Author:
Wu Qing,Liu Qing-Yang,Ling Xiang,Zhang Li-Jun
Abstract
Abstract
In real communication or transportation systems, loss of agents is very common due to finite storage capacity. We study the traffic dynamics in finite buffer networks and propose a routing strategy motivated by a heuristic algorithm to alleviate packet loss. Under this routing strategy, the traffic capacity is further improved, comparing to the shortest path routing strategy and efficient routing strategy. Then we investigate the effect of this routing strategy on the betweenness of nodes. Through dynamic routing changes, the maximum node betweenness of the network is greatly reduced, and the final betweenness of each node is almost the same. Therefore, the routing strategy proposed in this paper can balance the node load, thereby effectively alleviating packet loss.
Subject
Statistics, Probability and Uncertainty,Statistics and Probability,Statistical and Nonlinear Physics
Reference54 articles.
1. Collective dynamics of ‘small-world’ networks;Watts;Nature,1998
2. Emergence of scaling in random networks;Barabási;Science,1999
3. Traffic dynamics on complex networks: a survey;Chen;Math. Probl. Eng.,2012
4. Traffic flow and efficient routing on scale-free networks: a survey;Wang,2006
5. Transport on complex networks: flow, jamming and optimization;Tadić;Int. J. Bifurcat. Chaos,2007
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献