Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach

Paths with loops, even transient ones, pose significant stability problems in networks. As a result, much effort has been devoted over the past thirty years to designing distributed algorithms capable of avoiding loops. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), that guarantees that no loops, transient or steady-state, can ever form. DIV's novelty is in that it is not restricted to shortest paths, can easily handle arbitrary sequences of changes and updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, DIV also prevents counting-to-infinity; hence further improving convergence. The paper introduces DIV and its key properties. Simulation quantifying its performance gains are also presented.

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

[2]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[3]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[4]  Albert G. Greenberg,et al.  Experience in black-box OSPF measurement , 2001, IMW '01.

[5]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[6]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  J. J. Garcia-Luna-Aceves,et al.  EIGRP--A Fast Routing Protocol based on Distance Vectors , 1994 .

[8]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[9]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[10]  Y. Ohba.  Issues on loop prevention in MPLS networks , 1999, IEEE Commun. Mag..

[11]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[12]  John Baillieul,et al.  Information patterns and Hedging Brockett's theorem in controlling vehicle formations , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[13]  Hong Yan,et al.  A clean slate 4D approach to network control and management , 2005, CCRV.

[14]  Nick Feamster,et al.  The case for separating routing from routers , 2004, FDNA '04.

[15]  A. Udaya Shankar,et al.  Transient and steady-state performance of routing protocols: distance-vector versus link-state , 1992 .

[16]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[17]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[18]  Gary Scott Malkin,et al.  RIP Version 2 , 1998, RFC.

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

[20]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[21]  Olivier Bonaventure,et al.  Avoiding transient loops during IGP convergence in IP networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[23]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[24]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.