Generalized minimum information path routing strategy on scale-free networks

doi:10.1088/1674-1056/20/8/080501

中国物理B ›› 2011, Vol. 20 ›› Issue (8): 80501-080501.doi: 10.1088/1674-1056/20/8/080501

Generalized minimum information path routing strategy on scale-free networks

李微¹, 周思源², 王开², 张毅锋², 裴文江², 濮存来²

(1)School of Computer Science and Engineering, Southeast University, Nanjing 210096, China; (2)School of Information Science and Engineering, Southeast University, Nanjing 210096, China

收稿日期:2010-12-13 修回日期:2011-02-28 出版日期:2011-08-15 发布日期:2011-08-15
基金资助:
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.

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

Received:2010-12-13 Revised:2011-02-28 Online:2011-08-15 Published:2011-08-15
Supported by:
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.

摘要/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.

关键词: scale-free networks, routing strategy, minimum information path

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.

Key words: scale-free networks, routing strategy, minimum information path

中图分类号: (Computational methods in statistical physics and nonlinear dynamics)

05.10.-a

89.75.Hc (Networks and genealogical trees) 89.20.Hh (World Wide Web, Internet) 87.23.Ge (Dynamics of social systems)

周思源, 王开, 张毅锋, 裴文江, 濮存来, 李微. Generalized minimum information path routing strategy on scale-free networks[J]. 中国物理B, 2011, 20(8): 80501-080501.

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[J]. Chin. Phys. B, 2011, 20(8): 80501-080501.

参考文献 25

[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

Generalized minimum information path routing strategy on scale-free networks

Generalized minimum information path routing strategy on scale-free networks

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献 25

相关文章 15

Metrics

本文评价

推荐阅读 0

[1]	苏桂锋, 李晓温, 张小兵, 张一. Finite density scaling laws of condensation phase transition in zero-range processes on scale-free networks[J]. 中国物理B, 2020, 29(8): 88904-088904.
[2]	濮存来, 李杰, 陈荣斌, 许忠奇. Multiple-predators-based capture process on complex networks[J]. 中国物理B, 2017, 26(3): 38901-038901.
[3]	李世宝, 孙宗星, 刘建航, 陈海华. Optimized routing strategy for complex network with multiple priorities[J]. 中国物理B, 2016, 25(8): 88902-088902.
[4]	解维浩, 周斌, 刘恩晓, 卢为党, 周婷. Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network[J]. 中国物理B, 2015, 24(9): 98903-098903.
[5]	宋海权, 郭进. Improved routing strategy based on gravitational field theory[J]. 中国物理B, 2015, 24(10): 108901-108901.
[6]	刘刚, 李永树, 张喜平. Analysis of network traffic flow dynamics based on gravitational field theory[J]. 中国物理B, 2013, 22(6): 68901-068901.
[7]	凌翔, 胡茂彬, 丁建勋. Effects of node buffer and capacity on network traffic[J]. 中国物理B, 2012, 21(9): 98902-098902.
[8]	蔡绍洪, 张达敏, 龚光武, 郭长睿. Integrated systemic inflammatory response syndrome epidemic model in scale-free networks[J]. 中国物理B, 2011, 20(9): 90503-090503.
[9]	闫栋, 董明, Abdelaziz Bouras, 于随然. Poor–rich demarcation of Matthew effect on scale-free systems and its application[J]. 中国物理B, 2011, 20(4): 40205-040205.
[10]	张连明, 邓晓衡, 余建平, 伍祥生. Degree and connectivity of the Internet's scale-free topology[J]. 中国物理B, 2011, 20(4): 48902-048902.
[11]	郭进利, 郭曌华, 刘雪娇. Mobile user forecast and power-law acceleration invariance of scale-free networks[J]. 中国物理B, 2011, 20(11): 118902-118902.
[12]	刘锋, 赵寒, 李明, 任丰原, 朱衍波. Adaptive local routing strategy on a scale-free network[J]. 中国物理B, 2010, 19(4): 40513-040513.
[13]	孙巍, 窦丽华. Convergence speed of consensus problems over undirected scale-free networks[J]. 中国物理B, 2010, 19(12): 120513-120513.
[14]	祁伟, 许新建, 汪映海. Improving consensual performance of multi-agent systems in weighted scale-free networks[J]. 中国物理B, 2009, 18(10): 4217-4221.
[15]	吴俊, 谭跃进, 邓宏钟, 朱大智. Normalized entropy of rank distribution: a novel measure of heterogeneity of complex networks[J]. 中国物理B, 2007, 16(6): 1576-1580.