|
|
Generalized minimum information path routing strategy on scale-free networks |
Zhou Si-Yuan(周思源)a), Wang Kai(王开)a), Zhang Yi-Feng(张毅锋)a) , Pei Wen-Jiang(裴文江)a)† , Pu Cun-Lai(濮存来)a), and Li Wei(李微)b) |
a School of Information Science and Engineering, Southeast University, Nanjing 210096, China; b School of Computer Science and Engineering, Southeast University, Nanjing 210096, China |
|
|
Abstract This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.
|
Received: 13 December 2010
Revised: 28 February 2011
Accepted manuscript online:
|
PACS:
|
05.10.-a
|
(Computational methods in statistical physics and nonlinear dynamics)
|
|
89.75.Hc
|
(Networks and genealogical trees)
|
|
89.20.Hh
|
(World Wide Web, Internet)
|
|
87.23.Ge
|
(Dynamics of social systems)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant No. 60972165), the National High Technology
Project of China (Grant No. 2007AA11Z210), the Doctoral Fund of Ministry of Education of China (Grant Nos. 20100092120012,
20070286004), the Foundation of High Technology Project in Jiangsu Province, the Natural Science Foundation of Jiangsu Province
(Grant No. BK2010240), and the Special Scientific Foundation for the“Eleventh-Five-Year” Plan of China. |
Cite this article:
Zhou Si-Yuan(周思源), Wang Kai(王开), Zhang Yi-Feng(张毅锋) Pei Wen-Jiang(裴文江) Pu Cun-Lai(濮存来), and Li Wei(李微) Generalized minimum information path routing strategy on scale-free networks 2011 Chin. Phys. B 20 080501
|
[1] |
Tadic B, Rodgers G J and Thurner S 2007 Int. J. Bifur. Chaos 17 1363
|
[2] |
Zhang G Q, Wang D and Li G J 2007 Phys. Rev. E 76 017101
|
[3] |
Liu Z, Hu M B, Jiang R, Wang W X and Wu Q S 2007 Phys. Rev. E 76 037101
|
[4] |
Zhang G Q, Zhou S, Wang D and Yan G 2010 Physica A (in press)
|
[5] |
Chen Z Y and Wang X F 2006 Phys. Rev. E 73 036107
|
[6] |
Zhao L, Lai Y C, Park K and Ye N 2005 Phys. Rev. E 71 026125
|
[7] |
Yan G, Zhou T, Hu B, Fu Z Q and Wang B H 2006 Phys. Rev. E 73 046108
|
[8] |
Danila B, Yu Y, Marsh J A and Bassler K E 2006 Phys. Rev. E 74 046106
|
[9] |
Ramasco J J, Lama M, Lopez E and Boettcher S arXiv: 1006.0711v1
|
[10] |
Wang W X, Wang B H, Yin C Y, Xie Y B and Zhou T 2006 Phys. Rev. E 73 026111
|
[11] |
Yin C Y, Wang B H, Wang W X, Yan G and Yang H J 2006 Eur. Phys. J. B 49 205
|
[12] |
Ling X, Hu M B, Jiang R, Wang R, Cao X B and Wu Q S 2009 Phys. Rev. E 80 066110
|
[13] |
Feng L, Han Z, Li M, Ren F Y and Zhu Y B 2010 Chin. Phys. B 19 040513
|
[14] |
Zhang H, Liu Z H, Tang M and Hui P M 2007 Phys. Lett. A 364 177
|
[15] |
Boguna M, Krioukov D, Claffy K, Serrano M and Papadopoulos F 2009 Nat. Phys. 5 74
|
[16] |
Bogu n'a M and Krioukov D 2009 Phys. Rev. Lett. 102 058701
|
[17] |
Wang S P and Pei W J 2009 Physica A 388 514
|
[18] |
Wang S P and Pei W J 2010 arXiv: 1007.1809v1
|
[19] |
Wang K, Zhang Y F, Zhou S Y, Pei W J, Li T and Wang S P 2010 Physica A (accepted)
|
[20] |
Sneppen K, Trusina A and Rosvall M 2004 arXiv: cond-mat/040755v1
|
[21] |
Rosvall M, Trusina A, Minnhagen P and Sneppen K 2005 Phys. Rev. Lett. 94 028701
|
[22] |
Lov'asz L 1993 Bolyai Soc. Math. Stud. 2 1
|
[23] |
Barab'asi A L and Albert R 1999 Science 286 509
|
[24] |
Arenas A, D'hiaz-Guilera A and Guimer`a R 2001 Phys. Rev. Lett. 86 3196
|
[25] |
Zhao L, Park K and Lai Y C 2004 Phys. Rev. E 70 035101
|
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
|
|
|