An efficient probability routing algorithm for scale-free networks

Abstract To better utilize hub nodes within a network, this paper proposed an efficient probability (EP) routing algorithm which features using the importance degree to target critical nodes and subsequently redistribute incoming packets. Simulation results reveal that the proposed strategy is able to improve the network capacity in comparison to the shortest path (SP) routing strategy and the centrality-degree-based probability path (PP) routing algorithm. Moreover, the average routing path length of the EP is over 30% shorter than that of the PP, though it is 10% longer than that of the SP.

[1]  Aert Kuipers.  Occam's puzzle pencil , 2008 .

[2]  Yuki Naganuma,et al.  A packet routing strategy using neural networks on scale-free networks , 2010 .

[3]  Wei Huang,et al.  Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network. , 2010, Chaos.

[4]  Yudong Sun,et al.  Collectively optimal routing for congested traffic limited by link capacity. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Bo Hu,et al.  Efficient routing on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Akito Igarashi,et al.  Efficient packet routing strategy in complex networks , 2012 .

[7]  Albert-László Barabási,et al.  Linked: The New Science of Networks , 2002 .

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Xiang Ling,et al.  Global dynamic routing for scale-free networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[11]  Zheng He,et al.  Probability routing strategy for scale-free networks , 2013 .

[12]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[13]  Zhong-Yuan Jiang,et al.  Incremental routing strategy on scale-free networks , 2013 .

[14]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[17]  Zhou Tao,et al.  Empirical study of Chinese city airline network , 2007 .

[18]  Li Ming.  Local routing strategy for scale-free networks based on degree-load joint preference , 2008 .

[19]  B. Kerner.  THE PHYSICS OF TRAFFIC , 1999 .

[20]  Xiao Fan Wang,et al.  Effects of network structure and routing strategy on network capacity. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Gui-Jun Pan,et al.  Transport optimization on complex gradient networks , 2016 .

[22]  Jelena Smiljanic,et al.  Efficient routing on small complex networks without buffers , 2013 .

[23]  F. C. Santos,et al.  Origin of peer influence in social networks. , 2014, Physical review letters.

[24]  Jiangang Zhang,et al.  Synchronization analysis of complex networks with multi-weights and its application in public traffic network , 2014 .

[25]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[26]  Cristian R. Munteanu,et al.  New Markov-Shannon Entropy models to assess connectivity quality in complex networks: from molecular to cellular pathway, Parasite-Host, Neural, Industry, and Legal-Social networks. , 2012, Journal of theoretical biology.

[27]  Vladica Tintor,et al.  Distributed Dijkstra sparse placement routing algorithm for translucent optical networks , 2008, Photonic Network Communications.

[28]  Ahmed S Elwakil,et al.  Fractional-order circuits and systems: An emerging interdisciplinary research area , 2010, IEEE Circuits and Systems Magazine.

[29]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[30]  Ernesto Estrada,et al.  Communicability betweenness in complex networks , 2009, 0905.4102.

[31]  Huan Zhang,et al.  An efficient approach of controlling traffic congestion in scale-free networks , 2006, ArXiv.

[32]  Artur Ziviani,et al.  DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks , 2013, Comput. Networks.

[33]  Huawei Shen,et al.  Bridgeness: a local index on edge significance in maintaining global connectivity , 2010, 1005.2652.

[34]  A Díaz-Guilera,et al.  Communication in networks with hierarchical branching. , 2001, Physical review letters.

[35]  A. Motter,et al.  Fluctuation-driven capacity distribution in complex networks , 2008, 0805.3725.