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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TopGen: A Library to Provide Simulation Tools with the Modeling of Interconnection Network Topologies 16

TopGen: A Library to Provide Simulation Tools with the Model...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Antonio Villar, Juan Maglione, German Escudero-Sahuquillo, Jesus Javier Garcia, Pedro Alfaro, Francisco J. Sanchez, Jose L. Quiles, Francisco J. Univ Castilla La Mancha Ciudad Real Spain

ISBN: (纸本)9781538678794

Topology modeling is a challenging topic in the design and development of tools that simulate the behavior of interconnection networks. During the last years we have seen the birth of several simulation tools and frameworks modeling interconnects, some of them doing brilliant efforts to do the code re-usable and extensible. The main differences among these simulation tools and frameworks is the level of granularity and abstraction of their network models. Different network models may generate duplicated efforts in modeling certain aspects of them, such as the network topology or the routing algorithm. If the topology generation and routing algorithm modeling were separated from the modeling of other network aspects, then the simulator developers could focus on developing non-existing models and new functionality, without wasting time in doing a work previously done by other simulation tool developers. In this paper we describe TopGen, an external library that can be integrated with any tool that simulates interconnection networks. TopGen provides a compendious of well-known network topologies that can be used to interconnect the network components, such as end nodes, channels, switches and routers. It also provides the corresponding knowledge to apply a compendious of routing algorithms to the modeled network topologies. TopGen also supports the definition of customized topologies that are not the standard ones, thanks to a special interface used for this purpose. We also provide details on how to integrate TopGen with a network simulator, by means of a simple API. Finally, we describe several use cases of the TopGen library.

关键词： Interconnection Networks Topologies routing algorithms Simulation Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

A hybrid multiple copy routing algorithm in space delay-tolerant networks

引用

Science China(Information Sciences) 2017年第4期60卷 124-134页

作者： Peng WAN Shi CHEN Tao YU Zhongjie HUA Beijing Institute of Tracking and Telecommunications Technology National Space Science Center Chinese Academy of Sciences

With the development of technology and applications in space delay-tolerant networks(SDTNs), increasing attention has been paid on the routing technologies between different DTN nodes. This paper proposes a novel hybrid multiple copy routing(HMCR) algorithm that can be applied not only to deterministic space scenarios but also to opportunistic space scenarios. HMCR combines contact graph and delivery probability metrics to make forwarding decisions. In order to verify the new HMCR algorithm’s performance, research work has been carried out to prove its availability in SDTNs. The analysis and simulation results show that, compared with other algorithms such as contact graph routing(CGR), Epidemic, and PRo PHET, the new HMCR algorithm performs well in the areas of message delivery ratios, average end-to-end delays, and transmission overhead, which proves to be suitable for highly dynamic SDTNs.

关键词： space delay-tolerant networks routing algorithms contact graph routing hybrid single copy rout ing hybrid multiple copy routing

来源：评论

学校读者我要写书评

暂无评论

Dynamic strategies optimizing benefits of fully autonomous shared vehicle fleets 21

Dynamic strategies optimizing benefits of fully autonomous s...

引用

21st IEEE International Conference on Intelligent Transportation Systems (ITSC)

作者： Lioris, Jennie Haj-Salem, Habib Seidowsky, Regine Lebacque, Jean-Patrick ENPC Paris France UPE IFSTTAR Paris France

ISBN: (纸本)9781728103235

A constrained optimization framework of a flexible demand responsive transport system is considered. An intelligently administered scheme consisting of unmanned vehicles, requiring no prior seat reservation is introduced ensuring high quality door-to-door services at reduced costs. A decentralized decision making scheme comprised of various model based adaptive control patterns is developed. At any time optimized use of the available vehicle capacity is achieved while keeping cars as busy as possible. Vehicle itineraries are smartly defined according to their current state, traffic conditions and demand as well customer preferences. Tolerated passenger detours are respected while taking into consideration the related client waiting time. The asynchronous system behavior is modeled based on theory and methodology of discrete event dynamic systems (DEDS). Discrete event simulations permit evaluation of the system performance as well optimal tuning of the involved control algorithms. After identification of the desirable DEDS states the system is guided to controllable events infinitely often. As a case study, the city of Paris is considered. A comparative study is conducted appraising the suggested vehicle fleet versus a scheme consisting of self-service autonomous vehicles (SSAV). Metrics on cars, clients and network are presented such as trip durations, client waiting time and queue lengths at nodes, vehicle occupancy etc.

关键词： Demand responsive transport autonomous connected vehicles management discrete-event simulation Monte Carlo simulation routing algorithms performance evaluation parameter optimisation

来源：评论

学校读者我要写书评

暂无评论

A comparative study of vehicles' routing algorithms for route planning in smart cities

A comparative study of vehicles' routing algorithms for rout...

引用

2012 1st International Workshop on Vehicular Traffic Management for Smart Cities, VTM 2012

作者： Nha, Vi Tran Ngoc Djahel, Soufiene Murphy, John Lero UCD School of Computer Science and Informatics Ireland

ISBN: (纸本)9781467350280

Vehicle routing problem (VRP) is a generic name referring to optimization problems in transportation, distribution and logistics industry. They mainly focus on serving a number of customers by a number of vehicles. Route planning techniques is one of the main tasks of VRP which aims to find an optimal route from a starting point to a destination on a road map. As road traffic conditions may change during the car journey (e.g., increase/decrease of the congestion level, road incidents etc), the optimal route should be re-evaluated as soon as an update in traffic conditions is available. Choosing an appropriate route planning algorithm among the existing algorithms in the literature to apply it in real road networks is an important task for any transportation application. In this paper, we first present a classification of the different route planning algorithms, and then explain how we compare and analyze their performance when they are applied in real road networks. For the purpose of comparison, we simulate the behavior of these algorithms during runtime using Simulation of Urban Mobility (SUMO) package and TRACI. We have chosen Dijkstra, the most wellknown shortest path algorithm, to be the first algorithm to be implemented in SUMO. Upon reception of any traffic conditions update that affects the current optimal route of a car, we use TRACI to re-apply the algorithm and change this cars route accordingly. In the near future, our target is to simulate other algorithms and compare their performance based on the quality of the obtained best route. © 2012 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Simulation analysis of the Satellite-Network routing algorithms

Simulation analysis of the Satellite-Network Routing Algorit...

引用

2012 International Conference on Electrical Insulating Materials and Electrical Engineering, EIMEE 2012

作者： Lin, Qi Li, Zhi Key Laboratory Academy of Equipment Beijing China

ISBN: (纸本)9783037854518

A simulation test methodology has been developed to evaluate Satellite-Network routing algorithms. The test technique simulates problems routing algorithms encounter in satellite network by selecting the routing strategies which take minimal hop, minimal delay, and minimal transmitting power as principles and addressing them from building a satellite network simulation scenario in which the simulation test approach is applied and recording their performances in the form of statistical summaries. © (2012) Trans Tech Publications, Switzerland.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimal Single-Path routing Algorithm in the Datacenter Network DPillar

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2017年第3期28卷 689-703页

作者： Erickson, Alejandro Kiasari, Abbas E. Navaridas, Javier Stewart, Iain A. Univ Durham Sch Engn & Comp Sci South Road Durham DH1 3LE England Univ Manchester Sch Comp Sci Oxford Road Manchester M13 9PL Lancs England

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph;hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.

关键词： Datacenter networks routing algorithms shortest paths symmetry

来源：评论

学校读者我要写书评

暂无评论

Power-saving routing algorithms in wireless mesh networks: A survey 11

Power-saving routing algorithms in wireless mesh networks: A...

引用

11th Conference of Open Innovations Association FRUCT, FRUCT 2012

作者： Nagabhushan, T.N. Shiva Prakash, S.P. Krinkin, Kirill Mobile Innovation Lab Dept. of Information Science and Engineering Sri Jayachamarajendra College of Engineering Mysore India Open Source and Linux Lab Electrotechnical University St.-Petersburg Russia

ISBN: (纸本)9785808807075

In Wireless Mesh Networks, nodes often have a limited battery supply to use for the sending and reception of transmissions. By allowing nodes to relay messages for other nodes, the distance that needs to be bridged can be reduced, thus limiting the energy needed for a transmission. However, the number of transmissions a node needs to perform increases costing more energy. Power-aware routing refers to the mechanism of taking into account the remaining battery capacity of the node in order to decide on whether or not to relay traffic. The usage of nodes having low capacity should be avoided for relaying traffic. Efficient routing algorithm is used to find out cheapest route ie, based on number of hops within a mesh network. This refers to high load on some nodes, that in turn refer to uneven battery discharge over the nodes. So power aware routing is based on the amount of battery a node is having. In this paper, we present the related works on lowest consumption of energy, Tools used to simulate, we provide a comparative analysis. Finally we present the challenges in power-save routing algorithms in Wireless Mesh Networks. © 2012 FRUCT.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：