Engineering a New Loop-Free Shortest Paths Routing Algorithm

We present LFR (Loop Free Routing), a new loop-free distance vector routing algorithm, which is able to update the shortest paths of a distributed network with n nodes in fully dynamic scenarios. If Φ is the total number of nodes affected by a set of updates to the network, and φ is the maximum number of destinations for which a node is affected, then LFR requires O(Φ ·Δ) messages and O(n+φ ·Δ) space per node, where Δ is the maximum degree of the nodes of the network. We experimentally compare LFR with DUAL, one of the most popular loop-free distance vector algorithms, which is part of CISCO's EIGRP protocol and requires O(Φ ·Δ) messages and Θ(n ·Δ) space per node. The experiments are based on both real-world and artificial instances and show that LFR is always the best choice in terms of memory requirements, while in terms of messages LFR outperforms DUAL on real-world instances, whereas DUAL is the best choice on artificial instances.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  J. Spragins.  OSPF: Anatomy Of An Internet Routing Protocol [Book Reviews] , 1998, IEEE Network.

[3]  Daniele Frigioni,et al.  Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks , 2012, Algorithmica.

[4]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .

[5]  Daniele Frigioni,et al.  A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation , 2010, SEA.

[6]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2011 , 2011, Lecture Notes in Computer Science.

[7]  Roch Guérin,et al.  Always Acyclic Distributed Path Computation , 2010, IEEE/ACM Transactions on Networking.

[8]  S. Venkatesan,et al.  On Finding and Updating Shortest Paths Distributively , 1992, J. Algorithms.

[9]  Pierre A. Humblet,et al.  Another adaptive distributed shortest path algorithm , 1991, IEEE Trans. Commun..

[10]  Daniele Frigioni,et al.  Partially dynamic efficient algorithms for distributed shortest paths , 2010, Theor. Comput. Sci..

[11]  Ariel Orda,et al.  Distributed shortest-path protocols for time-dependent networks , 1996, Distributed Computing.

[12]  Mattia D'Emidio,et al.  A Speed-Up Technique for Distributed Shortest Paths Computation , 2011, ICCSA.

[13]  Alan L. Cox,et al.  On Count-to-Infinity Induced Forwarding Loops Ethernet Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Yuan’an Liu,et al.  A More Efficient Diffusing Update Algorithm For Loop-Free Routing , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[15]  Baruch Awerbuch,et al.  Approximate distributed Bellman-Ford algorithms , 1994, IEEE Trans. Commun..

[16]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[17]  Eric C. Rosen,et al.  The Updating Protocol of ARPANET's New Routing Algorithm , 1980, Comput. Networks.

[18]  Daniele Frigioni,et al.  A fully dynamic algorithm for distributed shortest paths , 2003, Theor. Comput. Sci..

[19]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[20]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[21]  Hongke Zhang,et al.  RD: Reducing message overhead in DUAL , 2009, 2009 IEEE International Conference on Network Infrastructure and Digital Content.