Distributed multiple path routing in complex networks

¹ College of Physics and Electronic Engineering, Taizhou University - Taizhou 318000, PRC
² Department of Mathematics, Southeast University - Nanjing 210096, PRC
³ College of Computer Science and Technology, Zhejiang University of Technology - Hangzhou 310023, PRC

Received: 14 November 2016
Accepted: 14 January 2017

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.