arXiv Analytics

Sign in

arXiv:cond-mat/0505366AbstractReferencesReviewsResources

Efficient routing on complex networks

Gang Yan, Tao Zhou, Bo Hu, Zhong-Qian Fu, Bing-Hong Wang

Published 2005-05-15, updated 2005-08-18Version 2

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.

Comments: 4 pages, 4 figures
Journal: Phys. Rev. E 73, 046108 (2006)
Categories: cond-mat.dis-nn
Related articles: Most relevant | Search more
arXiv:cond-mat/0509042 (Published 2005-09-01)
Fluctuation-dissipation relations for complex networks
arXiv:cond-mat/0401038 (Published 2004-01-05, updated 2004-01-06)
Long Chaotic Transients in Complex Networks
arXiv:1008.0022 [cond-mat.dis-nn] (Published 2010-07-30, updated 2010-10-15)
Predicting criticality and dynamic range in complex networks: effects of topology