Optimal Capacity Allocation on Heterogeneous Complex Transport Networks
LIU Wei-Kai1,2, GUAN Zhi-Hong1, LIAO Rui-Quan3
1Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074 2School of Science, Wuhan Institute of Technology, Wuhan 430073 3Petroleum Engineering College, Yangtze University, Jingzhou 420400
Optimal Capacity Allocation on Heterogeneous Complex Transport Networks
LIU Wei-Kai1,2, GUAN Zhi-Hong1, LIAO Rui-Quan3
1Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074 2School of Science, Wuhan Institute of Technology, Wuhan 430073 3Petroleum Engineering College, Yangtze University, Jingzhou 420400
摘要We study how the node delivering capacity is allocated so that the traffic transport efficiency can be enhanced maximally. Network heterogeneity of degree distribution and processing delay of the traffic are considered. An explicit analytical solution is provided, which is based on the M/M/1 queueing theory and optimization principle, provided that the network structure and routing strategy are given. In particular, we extend the relevant conclusions in the literature [Eurphys. Lett. 83 (2008) 28001]. Finally, an order parameter simulation example by comparing results with those obtained via simple capacity allocation in large Barabasi-Albert (BA) scale-free network is provided to illustrate the effectiveness of the theoretical results
Abstract：We study how the node delivering capacity is allocated so that the traffic transport efficiency can be enhanced maximally. Network heterogeneity of degree distribution and processing delay of the traffic are considered. An explicit analytical solution is provided, which is based on the M/M/1 queueing theory and optimization principle, provided that the network structure and routing strategy are given. In particular, we extend the relevant conclusions in the literature [Eurphys. Lett. 83 (2008) 28001]. Finally, an order parameter simulation example by comparing results with those obtained via simple capacity allocation in large Barabasi-Albert (BA) scale-free network is provided to illustrate the effectiveness of the theoretical results
[1] Boccaletti S, Latora V, Moreno Y, Chavez M and Hwang D U 2006 Phys. Rep. 422 175
[2] Barrat A, Barthlemy M and Vespignani A 2008 Dynamical Processes on Complex Networks (Cambridge: Cambridge University)
[3] Albert R and Barabsi A L 2002 Rev. Mod. Phys. 74 47
[4] Dorogovtsev S N, Goltsev A V and Mendes J F F 2008 Rev. Mod. Phys. 80 1275
[5] Gong X, Kun L and Lai C H 2008 Europhys. Lett. 83 28001
[6] Kuhn R and Mostafavi S M 2008 IEEE Commun. Lett. 12 222
[7] Wang W, Wu Z, Jiang R, Chen G and Lai C H 2009 Chao 19 033106
[8] Yang R, Wang W, Lai C H and Chen G 2009 Phys. Rev. E 79 026112
[9] Kim D H and Motter A E 2008 J. Phys. A: Math. Theor. 41 224019
[10] Guimera R, Díaz-Guilera A, Vega-Redondo F, Cabrales A and Arenas A 2002 Phys. Rev. Lett. 89 248701
[11] Tadic B, Rodgers G J and Thurner S 2007 Int. J. Bifur. Chaos 17 7
[12] Ou Q, Jin Y D, Zhou T, Wang B H and Yin B Q 2007 Phys. Rev. E 75 021102
[13] Danila B, Yu Y, Marsh J A, and Bassler K E 2007 Chaos 17 026102
[14] Lee K H and Hu P M 2008 Physica A 387 6657
[15] Zhao L, Cupertino T H, Park K, Lai Y C and Jin X 2007 Chao 17 043103
[16] Duch J and Arenas A 2006 Phys. Rev. Lett. 96 218702
[17] Barabasi A Land Albert R 1999 Science 286 509
[18] Kleinrock L 1975 Queueing Systems: Volume I-Theory (New York: Wiley Interscience)
2010, Vol. 27 
