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

Impact of routing and wavelength selection strategies on GMPLS-controlled distributed restoration

JOURNAL OF OPTICAL NETWORKING 2008年第5期7卷 388-399页

作者： Sambo, Nicola Cerutti, Isabella Giorgetti, Alessio Castoldi, Piero Scuola Super Sant Anna Pisa Italy

The restorability problem in wavelength-routed networks without wavelength converters is investigated. A distributed control plane based on the generalized multiprotocol label switching (GMPLS) suite is considered for disseminating link-state information and reserving network resources. Different routing and wavelength selection strategies are proposed and a detailed performance analysis is carried out during restoration. Simulation results evaluate the blocking probability due to both lack of available resources (i.e., forward blocking) and resource contentions (i.e., backward blocking). Performance comparison provides some insightful suggestions to be applied to GMPLS-controlled wavelength-routed networks without wavelength converters. First, it is recommended to perform routing and wavelength selection separately at the lightpath source and destination, respectively. Second, routing can be computed on link-state information advertised during provisioning, without the need of flooding link-state information during restoration. In fact, during restoration, the resource contention among concurrent signaling instances is the dominant cause of blocking (i.e., backward blocking overcomes forward blocking). For this reason, intelligent routing and wavelength selection strategies aiming at avoiding or limiting resource contentions can help to improve restorability. In particular, among those strategies, the proposed wavelength selection has a better ability to reduce resource contentions than the routing strategies. (C) 2008 Optical Society of America.

关键词： Network restoration Network topology Optical networks routing algorithms Switching Wavelength division multiplexing

来源：评论

学校读者我要写书评

暂无评论

An Improved routing Algorithm Based on Ant Colony Optimization in Wireless Sensor Networks

引用

IEEE COMMUNICATIONS LETTERS 2017年第6期21卷 1317-1320页

作者： Sun, Yongjun Dong, Wenxin Chen, Yahuan Xidian Univ Dept Commun Engn Xian 710071 Peoples R China

How to make efficient data routing in energy constrained wireless sensor networks (WSNs) is one of the key points. In order to find the optimal path of data transmission in the WSNs, a new routing algorithm based on ant colony algorithm is proposed. Using the improved heuristic function and considering the node communication transmission distance, transmission direction, and residual energy, an optimal path from the source node to the destination node can be found. Thus, the network energy consumption is reduced and the network lifetime is prolonged. Simulation results show that new ant algorithm can effectively save the energy of nodes and prolong the network lifetime.

关键词： Wireless sensor networks routing algorithms ant colony optimization energy consumption network lifetime

来源：评论

学校读者我要写书评

暂无评论

Waveband Switching, routing, and Grooming: introduction to the feature issue

引用

JOURNAL OF OPTICAL NETWORKING 2007年第2期6卷 217-218页

作者： Zheng, Jun Jue, Jason P. Univ Ottawa Ottawa ON K1N 6N5 Canada Univ Texas Dallas Dallas TX 75230 USA

Feature Issue on Waveband Switching, routing, and GroomingWe present a collection of high-quality research papers that reflect recent research advances in the area of waveband switching, routing, and grooming. By usin... 详细信息

Feature Issue on Waveband Switching, routing, and Grooming

We present a collection of high-quality research papers that reflect recent research advances in the area of waveband switching, routing, and grooming. By using WBS, the number of ports of an OXC can be significantly reduced, thus leading to reduced size, cost, and control complexity of the OXC.

关键词： Dense wavelength division multiplexing Multiplexers Optical networks routing algorithms Switching

来源：评论

学校读者我要写书评

暂无评论

Dynamic greedy routing in overlay networks using virtual coordinates from the hyperbolic plane

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2016年第4期27卷 519-532页

作者： Magoni, Damien Cassagnes, Cyril Univ Bordeaux LaBRI Talence France Univ Luxembourg SnT 6 Rue Richard Coudenhove Kalergi L-1359 Luxembourg Luxembourg

Greedy routing algorithms based on virtual coordinates have attracted considerable interest in recent years. Those based on coordinates taken from the hyperbolic plane have interesting theoretical scalability properties. However, their scalability and reliability are yet to be ensured when applied to large-scale dynamic networks. In this paper, we propose a scalable and reliable solution for creating and managing dynamic overlay networks where nodes have hyperbolic coordinates. In this context, our solution provides a greedy routing algorithm based on the hyperbolic distance. To cope with network dynamics, we have defined two methods for avoiding temporary local minima and one method for maintaining the greedy embedding over time. Through analysis, we evaluate the complexity costs of our solution. Through simulations, we assess the scalability of our solution on static networks and its reliability on dynamic networks. Results show that using our solution based on hyperbolic geometry provides scalability and reliability to both addressing and routing tasks in dynamic overlay networks. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： greedy method Scalability Hyperbolic dynamic network hyperbolic coordinates Lobachevskian geometry Coordinates routing algorithms overlay network

来源：评论

学校读者我要写书评

暂无评论

Optimally adaptive, minimum-distance, circuit-switched routing in hypercubes

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 1997年第2期15卷 166-193页

作者： Mahmood, A Lynch, DJ Shaffer, RB WASHINGTON STATE UNIV TRIC RICHLANDWA 99352

In circuit-switched routing, the path between a source and its destination is established by incrementally reserving all required links before the data transmission can begin. If the routing algorithm is not carefully designed, deadlocks can occur in reserving these links. Deadlock-free algorithms based on dimension-ordered routing, such as the E-cube, exist. However, E-cube does not provide any flexibility in choosing a path from a source to its destination and can thus result in long latencies under heavy or uneven traffic. Adaptive, minimum-distance routing algorithms, such as the Turn Model and the UP Preference algorithms, have previously been reported. In this article, we present a new class of adaptive, provably deadlock-free, minimum-distance routing algorithms. We prove that the algorithms developed here are optimally adaptive in the sense that any further flexibility in communication will result in deadlock. We show that the Turn Model is actually a member of our new class of algorithms that does not perform as well as other algorithms within the new class. It creates artificial hotspots in routing the traffic and allows fewer total paths. We present an analytical comparison of the flexibility and balance in routing provided by various algorithms and a comparison based on uniform and nonuniform traffic simulations. The Extended-UP Preference algorithm developed in this article is shown to have improved performance with respect to existing algorithms. The methodology and the algorithms developed here can be used to develop routing for other schemes such as wormhole routing, and for other recursively defined networks such as k-ary n-cubes.

关键词： adaptive routing circuit switched hypercube interconnection networks k-ary n-cube parallel processing routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A routing Algorithm for WiFi-Based Wireless Sensor Network and the Application in Automatic Meter Reading

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-9页

作者： Li, Li Hu, Xiaoguang Zhang, Baochang BeiHang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China BeiHang Univ Sch Automat Sci & Elect Engn Sci & Technol Aircraft Control Lab Beijing 100191 Peoples R China

The Automatic Meter Reading (AMR) network for the next generation Smart Grid is required to possess many essential functions, such as data reading and writing, intelligent power transmission, and line damage detection. However, the traditional AMR network cannot meet the previous requirement. With the development of the WiFi sensor node in the low power cost, a new kind of wireless sensor network based on the WiFi technology can be used in application. In this paper, we have designed a new architecture of WiFi-based wireless sensor network, which is suitable for the next generation AMR system. We have also proposed a new routing algorithm called Energy Saving-Based Hybrid Wireless Mesh Protocol (E-HWMP) on the premise of current algorithm, which can improve the energy saving of the HWMP and be suitable for the WiFi-based wireless sensor network. The simulation results show that the life cycle of network is extended.

关键词： routing algorithms WIRELESS Internet WIRELESS sensor networks APPLICATION software AUTOMATIC meter reading SMART power grids

来源：评论

学校读者我要写书评

暂无评论

COMPARATIVE EVALUATIONS OF RANDOMIZED AND DYNAMIC routing STRATEGIES FOR CIRCUIT-SWITCHED NETWORKS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1991年第1期39卷 102-116页

作者： MITRA, D SEERY, JB AT and T Bell Laboratories Inc. Murray Hill NJ USA

The theory and practice of circuit switching on networks has recently been rapidly evolving. We investigate two fundamentally separate classes of routing algorithms-randomized and deterministic. The main randomized algorithm is Gibbens' and Kelly's recently introduced Dynamic Alternate routing. In the contrasting deterministic algorithm, attempts to carry a call are made in a specific precomputed order. The design of these routing sequences given here is new and depends upon i) analytic approximations based on fixed-point equations to evaluate network performance, and ii) heuristics for the rather complicated problem of network revenue maximization. In all cases, an important role is played by the control mechanism of trunk reservations. Our test bed is a network of six nodes which is fully connected, except when we study the effects of various link failures. The network data are quite nonuniform and extracted from a realistic network. Our primary tool in this study is discrete-event simulation. We give results for each of the following goals: i) to evaluate and compare performance, primarily in terms of revenue generated;ii) to evaluate performance in the event of link failures;iii) to develop innovative design tools, iv) to develop an appreciation of the time constants of the various algorithms;and v) to propose new algorithms, especially hybrids.

关键词： deterministic algorithms Heuristics Dynamic routing control mechanism Fixed point algorithms routing algorithms ALTERNATIVE routing RANDOMISING REVENUE

来源：评论

学校读者我要写书评

暂无评论

Private routing and ride-sharing using homomorphic encryption

引用

IET CYBER-PHYSICAL SYSTEMS: THEORY & APPLICATIONS 2020年第4期5卷 311-320页

作者： Farokhi, Farhad Shames, Iman Johansson, Karl H. CSIROs Data61 Docklands Australia Univ Melbourne Dept Elect & Elect Engn Parkville Vic Australia KTH Royal Inst Technol Sch Elect Engn & Comp Stockholm Sweden

A framework for private and secure communication and interaction between agents interacting in transportation services is developed. An agent, i.e. a user, can ask questions or submit queries regarding whether the other agents, i.e. drivers, use the desired road at specific times of the day in an encrypted fashion. The authors developed the framework using semi-homomorphic encryption (namely, the Paillier's encryption method) to enable the algebraic manipulation of plain data without the need for decryption using appropriate computations over the encrypted data. Strong privacy and security guarantees are proved for the agents. Subsequently, the semi-homomorphic encryption method is utilised to develop privacy-aware ride-sharing and routing algorithms without the need for disclosing the origin and destination of the user.

关键词： cryptography data privacy vehicle routing driver information systems symbol manipulation private routing homomorphic encryption secure communication transportation services queries algebraic manipulation plain data encrypted data security guarantees semihomomorphic encryption method privacy-aware ride-sharing routing algorithms Paillier encryption method private communication

来源：评论

学校读者我要写书评

暂无评论

A developed Tabu Search algorithm for heterogeneous fleet vehicle routing problem

引用

IFAC-PapersOnLine 2019年第13期52卷 1051-1056页

作者： Meliani, Youssef Hani, Yasmina Elhaq, Sâad Lissane El Mhamedi, Abderrahman University of Hassan II ENSEM Casablanca Morocco Equipe Optimisation des systèmes de production et énergie France University of Paris 8 Paris France France

This paper deals with the vehicle routing problems for urban good distribution. The mix fleet size problem is a variant of the vehicle routing problem called Heterogeneous Fleet Vehicle routing Problem (HFVRP). The objective is to design a set of routes in order to minimize the sum of the costs. The purpose of this study is to develop a Tabu search (TS) heuristic to solve the HFVRP. The initial solution is obtained by a modified Clarke & Wright saving algorithm than treated by some fundamental and others new concepts of the TS algorithm. Our Tabu search algorithm uses a new procedure called Fusion in parallel with the split procedure in order to explore new search spaces. In addition, a number of neighborhood structure are combined together in a process for intensifying the local search. Besides, the proposed algorithm is boosted with an adaptive memory algorithm, known as probabilistic diversification and intensification. On several benchmark instances, the TS produces high-quality solutions, including two new best solutions for small sized instances. The results obtained illustrate the effectiveness of the approach and its applicability to routing problems. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Vehicle routing Benchmarking Fleet operations Learning algorithms routing algorithms Tabu search Vehicles Adaptive memory High quality solutions HVRP Last mile Local search Neighborhood structure Tabu search algorithms Vehicle routing Problems

来源：评论

学校读者我要写书评

暂无评论

CeRA: A router for symmetrical FPGAs based on exact routing density evaluation

引用

IEEE TRANSACTIONS ON COMPUTERS 2004年第7期53卷 829-842页

作者： Eum, NW Kim, T Kyung, CM Elect & Telecommun Res Inst Taejon 305350 South Korea Seoul Natl Univ Coll Engn Sch Elect Engn & Comp Sci Seoul 151744 South Korea Korea Adv Inst Sci & Technol Div Elect Engn Taejon 305701 South Korea

This paper presents a new performance and routability driven routing algorithm for symmetrical array-based field-programmable gate arrays (FPGAs). A key contribution of our work is the overcoming of one essential limitation of the previous routing algorithms: inaccurate estimations of routing density that were too general for symmetrical FPGAs. To this end, we formulate an exact routing density calculation that is based on a precise analysis of the structure (switch block) of symmetrical FPGAs and utilize it consistently in global and detailed routings. With an introduction to the proposed accurate routing metrics, we describe a new routing algorithm, called cost-effective net-decomposition-based routing, which is fast and yet produces remarkable routing results in terms of both routability and net/path delays. We performed extensive experiments to show the effectiveness of our algorithm based on the proposed cost metrics.

关键词： FPGAs routing algorithms performance routability routing density

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：