INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
|
|
|
Traffic resource allocation for complex networks |
Ling Xiang (凌翔)a, Hu Mao-Bin (胡茂彬)b, Long Jian-Cheng (龙建成)a, Ding Jian-Xun (丁建勋)a, Shi Qin (石琴)a |
a School of Transportation Engineering, Hefei University of Technology, Hefei 230009, China; b School of Engineering Science, University of Science and Technology of China, Hefei 230026, China |
|
|
Abstract In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.
|
Received: 12 May 2012
Revised: 04 July 2012
Accepted manuscript online:
|
PACS:
|
89.75.Hc
|
(Networks and genealogical trees)
|
|
45.70.Vn
|
(Granular models of complex systems; traffic flow)
|
|
05.70.Fh
|
(Phase transitions: general studies)
|
|
Fund: Project supported by the National Basic Research Program of China (Grant No. 2012CB725404), the National Natural Science Foundation of China ( Grant Nos. 71071044, 71171185, 71201041, and 71271075), and the Doctoral Program of the Ministry of Education, China ( Grant No. 20110111120023). |
Corresponding Authors:
Ding Jian-Xun
E-mail: dingjianxun@hfut.edu.cn
|
Cite this article:
Ling Xiang (凌翔), Hu Mao-Bin (胡茂彬), Long Jian-Cheng (龙建成), Ding Jian-Xun (丁建勋), Shi Qin (石琴) Traffic resource allocation for complex networks 2013 Chin. Phys. B 22 018904
|
[1] |
Watts D J and Strogaz S H 1998 Nature 393 440
|
[2] |
Barabási A L and Albert R 1999 Science 286 509
|
[3] |
Albert R and Barabási A L 2002 Rev. Mod. Phys. 74 47
|
[4] |
Newman M E J 2001 Phys. Rev. E 64 016132
|
[5] |
Newman M E J 2003 SIAM Rev. 45 167
|
[6] |
Boccaletti S, Latora V and Moreno Y 2006 Phys. Rep. 424 175
|
[7] |
Arenas A, Díaz-Guilera A D and Guimerá R 2001 Phys. Rev. Lett. 86 3196
|
[8] |
Martino D D, DallAsta L, Bianconi G and Marsili M 2009 Phys. Rev. E 79 015101(R)
|
[9] |
Wang Y Q and Jiang G P 2010 Acta Phys. Sin. 59 6725 (in Chinese)
|
[10] |
Song Y R and Jiang G P 2010 Acta Phys. Sin. 59 7546 (in Chinese)
|
[11] |
Menezes M A and Barabási A L 2004 Phys. Rev. Lett. 92 028701
|
[12] |
Duch J and Arenas A 2006 Phys. Rev. Lett. 96 218702
|
[13] |
Holme P and Kim B J 2002 Phys. Rev. E 65 066109
|
[14] |
Guimerá R, Díaz-Guilera A, Vega-Redondo F, Cabrales A and Arenas A 2002 Phys. Rev. Lett. 89 248701
|
[15] |
Kim B J, Yoon C N, Han S K and Jeong H 2002 Phys. Rev. E 65 027103
|
[16] |
Tadić B, Thurner S and Rodgers G J 2004 Phys. Rev. E 69 036102
|
[17] |
Wang W X, Wang B H, Yin C Y, Xie Y B and Zhou T 2006 Phys. Rev. E 73 026111
|
[18] |
Yan G, Zhou T, Hu B, Fu Z Q and Wang B H 2006 Phys. Rev. E 73 046108
|
[19] |
Ling X, Hu M B, Jiang R, Wang R L, Cao X B and Wu Q S 2009 Phys. Rev. E 80 066110
|
[20] |
Shen Y, Pei W J, Wang K and Wang S P 2009 Chin. Phys. B 18 3783
|
[21] |
Liu F, Zhao H, Li M, Ren F Y and Zhu Y B 2010 Chin. Phys. B 19 040513
|
[22] |
Yang H X, Wang W X, Wu Z X and Wang B H 2008 Physica A 387 6857
|
[23] |
Gong X F, Kun L and Lai C H 2008 Europhys. Lett. 83 28001
|
[24] |
Shen B and Gao Z Y 2008 Physica A 2008 387 1352
|
[25] |
Xia Y X and Hill D 2010 Europhys. Lett. 89 58004
|
[26] |
Newman M E J and Watts D J 1999 Phys. Rev. E 60 7332
|
[27] |
Erdös P and Rényi A 1959 Publ. Math. Debrecen 6 290
|
[28] |
Goh K I, Kahng B and Kim D 2001 Phys. Rev. Lett. 87 278701
|
[29] |
Meloni S, Arenas A and Moreno Y 2009 PNAS 106 16897
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|