检索结果-内蒙古大学图书馆

Asia Communications and Photonics Conference

作者： Yufei Luo Zixuan Xu Anhong Dang State Key Laboratory of Advanced Optical Communication Systems and Networks Department of Electronics Peking University Beijing 100871 China

We investigate the topology control for free-space optical networks in the presence of atmospheric attenuation. The base heuristic with bundle protocol scheme is proposed. Results show that the scheme is effective aga... 详细信息

ISBN: (纸本)9781943580705

关键词： Attenuation Fiber Bragg gratings Fog Free space optics Optical networks routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Enabling ASON routing via Novel Signal Quality Metrics

Enabling ASON Routing via Novel Signal Quality Metrics

引用

Optical Fiber Communication - OFC 2007 Collocated National Fiber Optic Engineers Conference (OFC 2007), vol.2

作者： Jonathan C. Li Kerry Hinton Sarah D. Dods Peter M. Farrell National ICT Australia Victorian Research Laboratory Building 193 The University of Melbourne VIC 3010 Australia ARC Special Center for Ultra-Broadband Information Networks Building 193 The University of Melbourne VIC 3010 Australia

We propose a new algorithm for path selection in Automatically Switched Optical Networks (ASONs), based on eye closure penalty, Q-factor and a modified OSPF protocol. We demonstrate the technique for a nine node network.

ISBN: (纸本)1557528306

关键词： Optical networks Optical signals Polarization mode dispersion Q factor routing algorithms Signal regeneration Fiber optics and optical communications (060.0060) Fiber optics communications (060.2330) Networks (060.4250)

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing Scheme for Irregular Mesh NoCs

An Efficient Routing Scheme for Irregular Mesh NoCs

引用

2013 IEEE 4th International Conference on Electronics Information and Emergency Communication

作者： Qingli Xiao Hongzhou Fu Lu Zheng Dexue Zhang College of Information Science and Engineering Shandong University of Science and Technology State-Key Lab. of ASIC and System Fudan University

ISBN: (纸本)9781467349345

Topological structure is an important part of the design of network on chip systems. The majority of current NoC architectures employ mesh topology, but at some practical application, NoC systems often integrate a number of heterogeneous blocks, or some fabrication faults, reliability issues, may lead to the need of irregular topologies. Consequently, simplistic routing techniques such as XY scheme can not be employed in irregular topologies. This paper presents an efficient specific routing scheme for the irregular mesh network which can be guaranteed for the connection in irregular topologies. This paper applies routing tables (RT) to realize the algorithm and use OVP (Open Virtual Platforms)+ TLM (Transaction Level Modeling)+systemC to create a virtual platform, achieving a 16 xl6 irregular mesh topology of heterogeneous systems. Finally the routing scheme is applied to test specific real application network instances, and the result shows its connectivity and efficiency.

关键词： network on chip routing algorithms irregular mesh network.

来源：评论

学校读者我要写书评

暂无评论

Impairment Constraint Based routing in Mesh Optical Networks

Impairment Constraint Based Routing in Mesh Optical Networks

引用

Optical Fiber Communication - OFC 2007 Collocated National Fiber Optic Engineers Conference (OFC 2007), vol.2

作者： Ioannis Tomkos Stelios Sygletos Anna Tzanakaki George Markidis Athens Information Technology AIT 195km Markopoulou Avenue Peania 19002 Athens Greece

We present a framework for the alleviation of the main problems induced due to optical transparency based on the use of advanced optical performance monitoring, physical layer modeling tools, and new algorithms for ro... 详细信息

ISBN: (纸本)1557528306

关键词： Network restoration Optical networks Optical signals Polarization mode dispersion routing algorithms Wavelength assignment Fiber optics and optical communications (060.0060) Networks (060.4250) Optical communications (060.4510)

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps∗

arXiv

引用

arXiv 2017年

作者： Devismes, Stéphane Ilcinkas, David Johnen, Colette Université Grenoble Alpes Grenoble France Univ. Bordeaux & CNRS LaBRI UMR 5800 TalenceF-33400 France

We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, Vr, and make all processes of other components detecting that r is not part of their connected component. We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global parameters of the network. We prove its correctness assuming the distributed unfair daemon, the most general daemon. Its stabilization time in rounds is at most 3nmaxCC +D, where nmaxCC is the maximum number of non-root processes in a connected component and D is the hop-diameter of Vr. Furthermore, if we additionally assume that edge weights are positive integers, then it stabilizes in a polynomial number of steps: namely, we exhibit a bound in O(WmaxnmaxCC3n), where Wmax is the maximum weight of an edge and n is the number of processes. Copyright © 2017, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Colorless, Directionless, and Partially Contentionless (CDpC) ROADM: a New Architecture for the Best Performance to Cost Ratio (Invited)

Colorless, Directionless, and Partially Contentionless (CDpC...

引用

Asia Communications and Photonics Conference

作者： Zhaoxin Zhong Longjin Lu Yongcheng Li Liangjia Zong Gangxiang Shen Suzhou Key Laboratory of Advanced Optical Communication Network Technology Soochow University P. R. China Huawei Technologies Co. Ltd Shenzhen P. R. China

We design a new colorless, directionless, and partially contentionless (CDpC) ROADM architecture to reduce the cost of fully contentionless modules in CDC ROADMs. Simulation studies show the blocking performance effic... 详细信息

ISBN: (纸本)9781943580705

关键词： Fiber networks Multiplexers Optical networks Reconfigurable optical add drop multiplexers routing algorithms Wavelength assignment

来源：评论

学校读者我要写书评

暂无评论

Bounded Dijkstra (BD): Search space reduction for expediting shortest path subroutines

arXiv

引用

arXiv 2019年

作者： van Bemten, Amaury Guck, Jochen W. Machuca, Carmen Mas Kellerer, Wolfgang Lehrstuhl für Kommunikationsnetze Technical University of Munich

The shortest path (SP) and shortest paths tree (SPT) problems arise both as direct applications and as subroutines of overlay algorithms solving more complex problems such as the constrained shortest path (CSP) or the constrained minimum Steiner tree (CMST) problems. Often, such algorithms do not use the result of an SP subroutine if its total cost is greater than a given bound. For example, for delay-constrained problems, paths resulting from a least-delay SP run and whose delay is greater than the delay constraint of the original problem are not used by the overlay algorithm to construct its solution. As a result of the existence of these bounds, and because the Dijkstra SP algorithm discovers paths in increasing order of cost, we can terminate the SP search earlier, i.e., once it is known that paths with a greater total cost will not be considered by the overlay algorithm. This early termination allows to reduce the runtime of the SP subroutine, thereby reducing the runtime of the overlay algorithm without impacting its final result. We refer to this adaptation of Dijkstra for centralized implementations as bounded Dijkstra (BD). On the example of CSP algorithms, we confirm the usefulness of BD by showing that it can reduce the runtime of some algorithms by 75% on average. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Average Delay SLAs in Cloud Computing

Average Delay SLAs in Cloud Computing

引用

IEEE International Conference on Communications

作者： Boonyarith Saovapakhiran Michael Devetsikiotis George Michailidis Yannis Viniotis Department of Electrical and Computer Engineering North Carolina State University Department of Statistics University of Michigan

ISBN: (纸本)9781457720529

In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system's dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.

关键词： mean delay Cloud Computing Heuristic algorithms time delay control Dispatching rules routing algorithms distributed parameter

来源：评论

学校读者我要写书评

暂无评论

Analysis of Meta-level Communication for Distributed Resource Allocation Problems 17

Analysis of Meta-level Communication for Distributed Resourc...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Matthew Saponaro Keith Decker Computer and Information Sciences University of Delaware

ISBN: (纸本)9781510855076

We examine the effects of meta-level-communication in the DSRAP (Distributed Sequential Resource Allocation Problem). In DSRAP, independent tasks are categorized into different types, where each task belonging to a particular task type shares a known distribution of task arrivals, durations, reward rates, maximum waiting times, and resource demands We first look at a single task type DSRAP (SD-SRAP) and develop an analytical model of the effect of meta-level communication about load on system performance for first-in-first-out (FIFO) local scheduling agents that forward tasks based on load. Through our analytical models and empirical results, we show how the frequency of communication affects performance for SDSRAP problems with one resource and task type. We then quantitatively measure the impact of meta-level communication on system performance with respect to the global measures of the system's load balance. We validate our analytical model's predictions experimentally, showing, e.g., as system load becomes unbalanced, performance decreases; organizational structure significantly impacts agent performance; and agents that can communicate and distribute tasks to neighbors significantly outperform agents working individually. Through our analysis on FIFO, routing algorithms, and our policy agents, we provide a framework for analyzing more complex task schedulers and task routing algorithms.

关键词： first-in first-out ANALYSIS MODELS Resource utilization Agents System performance Communication Research performance agents LOAD Religious Missions management of resources Distribute routing algorithms organization structure Analysis

来源：评论

学校读者我要写书评

暂无评论

A Data Forwarding Scheme with Reachable Probability Centrality in DTNs

A Data Forwarding Scheme with Reachable Probability Centrali...

引用

IEEE Wireless Communications and Networking Conference

作者： Jiagao Wu Jianming Wang Linfeng Liu Maryam Tanha Jianping Pan School of Computer Nanjing University of Posts and Telecommunications Department of Computer Science University of Victoria

ISBN: (纸本)9781467398152

Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly weaken the effectiveness of data transmission. Although social-based strategies can be used to deal with the problem, most existing approaches adopt multi-copy strategy to forward messages which inevitably add more unnecessary cost. One of the most important issues is the selection of the best intermediate node to forward messages to the destination node. In this paper, we focus on finding a quality metric associated with better relays which is evaluated by Reachable Probability Centrality (RPC) as we proposed. RPC combines the contact matrix and multi-hop forwarding probability based on the weighted social network, thus ensuring an effective relay selection. We also propose a distributed RPC-based routing algorithm, which demonstrates the applicability of our scheme in the decentralized environment of DTNs. Extensive trace-driven simulations show that RPC outperforms other centrality measures and our proposed routing algorithm can significantly reduce the data forwarding cost while having comparable delivery ratio and delay to those of the Epidemic routing.

关键词： RTCA gene remote procedure calls data forwarding Messages routing algorithms DTNA gene data transmission relay

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：