Distributed multiple path routing in complex networks. (8th February 2017)

• Record Type: Journal Article
• Authors: Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui
• Is Part Of: Europhysics letters. Volume 116:Number 6(2016:Dec.)
• Publication Date: 2017-02-08
• Subjects: 64.60.aq -- 89.75.Fb -- 05.60.-k; Physics -- Periodicals; Electronic journals; 530.05
• DOI: 10.1209/0295-5075/116/66001
• Languages: English
• ISSNs: 0295-5075

Abstract

Abstract: 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.