Xiaofeng Gong et al 2008 EPL 83 28001 doi:10.1209/0295-5075/83/28001
Xiaofeng Gong1,2, Li Kun1,2 and C.-H. Lai3,2
Show affiliationsThe problem of efficient transport on a complex network is studied in this paper. We find that there exists an optimal way to allocate resources for information processing on each node to achieve the best transport capacity of the network, or the largest input information rate which does not cause jamming in network traffic, provided that the network structure and routing strategy are given. More interestingly, this achievable network capacity limit is closely related to the topological structure of the network, and is actually inversely proportional to the average distance of the network, measured according to the same routing rule.
Issue 2 (July 2008)
Received 17 January 2008, accepted for publication 30 May 2008
Published 20 June 2008
Xiaofeng Gong et al 2008 EPL 83 28001
C. B. Korn and U. S. Schwarz 2008 EPL 83 28007
Xiao-Pu Han et al 2008 EPL 83 28003
T. Das and S. Chakraborty 2008 EPL 83 48003
Vesselin Petkov 1999 Nonlinearity 12 1663
Gemma De las Cuevas et al J. Stat. Mech. (2009) P07001
Jianjun Yang et al 2010 J. Phys.: Condens. Matter 22 095503
Caterina-E Mora et al 2008 New J. Phys. 10 083027
Ben-Hwa Jang et al 2008 J. Micromech. Microeng. 18 055020
Slava Krylov et al 2008 J. Micromech. Microeng. 18 055026