Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy

Abstract The shortest path is a basic routing model which is still used in many systems. However, due to the low exploitation of the delivery capacity of peripheral nodes, the performance achieved by this policy is very limited. Starting from the fact that changing all network routers by others more robust is not practical, we propose the improvement of the capacity of a scale-free network under the shortest path strategy by the implantation of global dynamic routers. We have studied two targeting approaches to designate specific nodes to route the packets following the global dynamic protocol; one is based on node degree and the other on its betweenness. We show that we already exceed twice the capacity under the shortest path protocol with only 4 % of global dynamic routers when we target nodes with high betweenness and 10 % when we target nodes with high degrees. Moreover, the average travelling time remains low while the network capacity increases.

[1]  Hamid Ez-Zahraouy,et al.  An adaptive routing scheme in scale-free networks , 2015 .

[2]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[3]  Jianfeng Ma,et al.  Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy , 2015 .

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

[5]  Fei Tan,et al.  Hybrid routing on scale-free networks , 2013 .

[6]  Kate A. Smith,et al.  Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research , 1999 .

[7]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[8]  Noureddine Zahid,et al.  Self Avoiding Paths Routing Algorithm in Scale-Free Networks , 2013, Chaos.

[9]  Hawoong Jeong,et al.  Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Wen-Xu Wang,et al.  Traffic dynamics based on an efficient routing strategy on scale free networks , 2006 .

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  A. Arenas,et al.  Dynamical properties of model communication networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Bo Chen,et al.  A Review of the Applications of Agent Technology in Traffic and Transportation Systems , 2010, IEEE Transactions on Intelligent Transportation Systems.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Yamir Moreno,et al.  Improved routing strategies for Internet traffic delivery. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Yamir Moreno,et al.  Dynamics of jamming transitions in complex networks , 2005 .

[17]  Piet Van Mieghem,et al.  On the complexity of QoS routing , 2003, Comput. Commun..

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

[19]  Ying-Cheng Lai,et al.  Attack vulnerability of scale-free networks due to cascading breakdown. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  A. Benyoussef,et al.  Pair-dependent rejection rate and its impact on traffic flow in a scale-free network , 2014 .

[21]  Fabricio A. Breve,et al.  Fuzzy community structure detection by particle competition and cooperation , 2012, Soft Computing.

[22]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

[24]  Wen-Xu Wang,et al.  Method to enhance traffic capacity for scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Dinesh Kumar Sharma,et al.  Finding the shortest path in stochastic networks , 2007, Comput. Math. Appl..

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

[27]  Tao Zhou,et al.  Efficient routing on scale-free networks based on local information , 2006 .

[28]  Tao Zhou,et al.  Traffic dynamics based on local routing protocol on a scale-free network. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Hamid Ez-Zahraouy,et al.  New behavior of degree distribution in connected communication networks , 2014 .

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

[31]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[32]  Siyuan Zhou,et al.  Optimal routing strategy based on the minimum information path , 2011 .

[33]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[34]  Ming Tang,et al.  An adaptive routing strategy for packet delivery in complex networks , 2007, ArXiv.

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

[36]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[37]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

[38]  Guanrong Chen,et al.  Optimal weighting scheme for suppressing cascades and traffic congestion in complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Massimo Riccaboni,et al.  Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Nong Ye,et al.  Onset of traffic congestion in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Alessandro P. S. de Moura,et al.  Fermi-Dirac statistics and traffic in complex networks. , 2005 .

[42]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  Rui Jiang,et al.  Bandwidth allocation strategy for traffic systems of scale-free network , 2010 .

[45]  Ken-ichi Funahashi,et al.  On the approximate realization of continuous mappings by neural networks , 1989, Neural Networks.

[46]  O. Sporns.  Structure and function of complex brain networks , 2013, Dialogues in clinical neuroscience.

[47]  L. D. Costa,et al.  Accessibility in complex networks , 2008 .

[48]  Kaiquan Cai,et al.  Effective usage of shortest paths promotes transportation efficiency on scale-free networks , 2013 .

[49]  G. J. Rodgers,et al.  Transport on Complex Networks: Flow, Jamming and Optimization , 2007, Int. J. Bifurc. Chaos.

[50]  Yuanwei Jing,et al.  Traffic dynamics based on a traffic awareness routing strategy on scale-free networks , 2008 .

[51]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[52]  Baoding Liu,et al.  Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm , 2006, Appl. Math. Comput..