Self Avoiding Paths Routing Algorithm in Scale-Free Networks

In this paper, we present a new routing algorithm called "the self avoiding paths routing algorithm." Its application to traffic flow in scale-free networks shows a great improvement over the so called "efficient routing" protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self consistent manner with a relatively small number of iterations by maintaining an equilibrated path distribution especially among the hubs. This results in a significant shifting of the critical packet generation rate over which traffic congestion occurs, thus permitting the network to sustain more information packets in the free flow state. The performance of the algorithm is discussed both on a Barábasi-Albert network and real autonomous system network data.

[1]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[2]  José J. Ramasco,et al.  Optimization of transport protocols with path-length constraints in complex networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Xiaogang Jin,et al.  Optimal structure of complex networks for minimizing traffic congestion. , 2007, Chaos.

[4]  J. Rogers.  Chaos , 1876 .

[5]  Yong Yu,et al.  Optimal routing on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[8]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[9]  Zoltán Toroczkai,et al.  Structural bottlenecks for communication in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[12]  Xiang Ling,et al.  Pheromone routing protocol on a scale-free network. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Tommy W S Chow,et al.  Investigation of both local and global topological ingredients on transport efficiency in scale-free networks. , 2009, Chaos.

[14]  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.

[15]  October I.  Physical Review Letters , 2022 .

[16]  J. Limb,et al.  Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .

[17]  Anna T. Lawniczak,et al.  Network traffic behaviour near phase transition point , 2005, nlin/0510070.

[18]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..

[19]  Ginestra Bianconi,et al.  Congestion phenomena on complex networks , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[22]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[23]  David Bawden,et al.  Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .

[24]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[25]  C. Herrero,et al.  Self-avoiding walks on scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Raj Jain,et al.  Architectures for the future networks and the next generation Internet: A survey , 2011, Comput. Commun..

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

[28]  Mohamed Othman,et al.  Improved balancing heuristics for optimizing shortest path routing , 2007, Comput. Commun..

[29]  Tao Zhou,et al.  Efficient routing on scale-free networks based on local information , 2005, physics/0506204.

[30]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

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

[32]  Yong Yu,et al.  Transport optimization on complex networks , 2007, Chaos.

[33]  Physics Letters , 1962, Nature.

[34]  Ronaldo M. Salles,et al.  Efficient Routing Heuristics for Internet Traffic Engineering , 2007, Comput. Commun..