|
|
Adaptive local routing strategy on a scale-free network |
Liu Feng(刘锋)a)† Zhao Han(赵寒) a), Li Ming(李明)a), Ren Feng-Yuan(任丰原) b), and Zhu Yan-Bo(朱衍波)a) |
a School of Electronics and Information Engineering, Beihang University, Beijing 100191, China; b Department of Computer Science and Technology,Tsinghua University, Beijing 100084, China |
|
|
Abstract Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.
|
Received: 12 October 2008
Revised: 27 October 2009
Accepted manuscript online:
|
PACS:
|
89.75.Hc
|
(Networks and genealogical trees)
|
|
02.50.Cw
|
(Probability theory)
|
|
45.70.Vn
|
(Granular models of complex systems; traffic flow)
|
|
Fund: Project supported in part by the
National Natural Science Foundation of China (Grant Nos.~60872011
and 60502017), the State Key Development Program for Basic Research
of China (Grant Nos.~2009CB320504 and 2010CB731800), and Program for
New Century Excelle |
Cite this article:
Liu Feng(刘锋) Zhao Han(赵寒), Li Ming(李明), Ren Feng-Yuan(任丰原), and Zhu Yan-Bo(朱衍波) Adaptive local routing strategy on a scale-free network 2010 Chin. Phys. B 19 040513
|
[1] |
Watts D J and Strogatz S H 1998 Nature (London) 393 440
|
[2] |
Albert R, Jeong H and Barabasi A L 1999 Nature (London) 401] 130
|
[3] |
Jeong H, Mason S P and Barabasi A L 2001 Nature (London) 411] 41
|
[4] |
Tadi B and Thurner S 2005 Physica A 346 183
|
[5] |
Echenique P, Gardenes J G and Moreno Y 2004 Phys. Rev. E 70] 056105
|
[6] |
Guimera R, Guilera A D, Redondo E V and Arenas A 2002 Phys. Rev. Lett. 89 248701
|
[7] |
Tadi B and Thurner S and Rodgers G J 2004 Phys. Rev. E 69 036102
|
[8] |
Danila B, Yu Y, Marsh J A and Bassler K E 2006 Phys. Rev. E 74 046106
|
[9] |
Yan G, Zhou T, Fu Z Q and Wang B H 2006 Phys. Rev. E 73 046108
|
[10] |
Hughes R D 1995 Random Walks: Random Walks and Random Environments] (Oxford: Clarendon) Vol. 1
|
[11] |
Wang W X, Wang B H, Yin C Y, Xie Y B and Zhou T 2006 Phys. Rev. E 73 026111
|
[12] |
Adamic L A, Lukose R M, Puniyani A R and Huberman B A 2001 Phys. Rev. E 64 046135
|
[13] |
Kim B J, Yoon C N, Han S K and Jeong H 2002 Phys. Rev. E 65 027103
|
[14] |
Moura A P S d, Motter A E and Grebogi C 2003 Phys. Rev. E 68 036106
|
[15] |
Barabasi A L and Albert R 1999 Science 286 509
|
[16] |
Guimera R, Arenas A, Guilera A D and Giralt F 2002 Phys. Rev. E 66 026704
|
[17] |
Arenas A, Guilera A D and Guimera R 2001 Phys. Rev. Lett. 86 3196
|
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
|
|
|