Global dynamic routing for scale-free networks
Authors:
- Mao-Bin HuMHMao-Bin Hu
- Rui JiangRJRui Jiang
- Qing-Song WuQWQing-Song Wu
- 28 January 2010
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 81 (1) , 016113
Abstract
Traffic is essential for many dynamic processes on networks. The efficient routing strategy [G. Yan, T. Zhou, B. Hu, Z. Q. Fu, and B. H. Wang, Phys. Rev. E 73, 046108 (2006)] can reach a very high capacity of more than ten times of that with shortest path strategy. In this paper, we propose a global dynamic routing strategy for network systems based on the information of the queue length of nodes. Under this routing strategy, the traffic capacity is further improved. With time delay of updating node queue lengths and the corresponding paths, the system capacity remains constant, while the travel time for packets increases.Keywords
This publication has 35 references indexed in Scilit:
- Congestion phenomena on complex networksPhysical Review E, 2009
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- Communication in Networks with Hierarchical BranchingPhysical Review Letters, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- Phase transition in a computer network traffic modelPhysical Review E, 1998
- Collective dynamics of ‘small-world’ networksNature, 1998
- Critical behaviors and 1/Φ noise in information trafficPhysica A: Statistical Mechanics and its Applications, 1996