Volume 116, Number 6, December 2016
|Number of page(s)||6|
|Section||Condensed Matter: Structural, Mechanical and Thermal Properties|
|Published online||08 February 2017|
Distributed multiple path routing in complex networks
1 College of Physics and Electronic Engineering, Taizhou University - Taizhou 318000, PRC
2 Department of Mathematics, Southeast University - Nanjing 210096, PRC
3 College of Computer Science and Technology, Zhejiang University of Technology - Hangzhou 310023, PRC
Received: 14 November 2016
Accepted: 14 January 2017
Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.
PACS: 64.60.aq – Networks / 89.75.Fb – Structures and organization in complex systems / 05.60.-k – Transport processes
© EPLA, 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.