Optimal resource allocation for efficient transport on complex networksXiaofeng Gong1, 2, Li Kun1, 2 and C.-H. Lai3, 2
1 Temasek Laboratories, National University of Singapore - 117508, Singapore
2 Beijing-Hong Kong-Singapore Joint Center of Nonlinear and Complex Systems (Singapore), National University of Singapore - 117508, Singapore
3 Department of Physics, National University of Singapore - 117542, Singapore
received 17 January 2008; accepted in final form 30 May 2008; published July 2008
published online 20 June 2008
The 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.
89.75.Hc - Networks and genealogical trees.
89.20.Hh - World Wide Web, Internet.
© EPLA 2008