Global dynamic routing for scale-free networks.
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.
Ling
Xiang
X
School of Engineering Science, University of Science and Technology of China, Hefei, People's Republic of China.
Hu
Mao-Bin
MB
Jiang
Rui
R
Wu
Qing-Song
QS