A unified approach to loop-free routing using distance vectors or link states

We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorithm that provides loop-free paths at every instant and extends or improves algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author. Our approach treats the problem of distributed shortest-path routing as one of diffusing computations, which was first proposed by Dijkstra and Scholten. We verify the loop-freedom of the new algorithm, and also demonstrate that it converges to the correct routing entries a finite time after an arbitrary sequence of topological changes. We analyze the complexity of the new algorithm when distance vectors and link states are used, and show that using distance vectors is better insofar as routing overhead is concerned.

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

[2]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  J.J. Garcia-Luna-Aceves.  A distributed, loop-free, shortest-path routing algorithm , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[5]  J. J. Garcia-Luna-Aceves,et al.  A Minimum-Hop Routing Algorithm Based on Distributed Information , 1989, Comput. Networks.

[6]  Jeffrey M. Jaffe.  Hierarchical Clustering with Topology Databases , 1988, Comput. Networks.

[7]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[8]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[9]  T. Cegrell,et al.  A Routing Procedure for the TIDAS Message-Switching Network , 1975, IEEE Trans. Commun..

[10]  Radia J. Perlman,et al.  Fault-Tolerant Broadcast of Routing Information , 1983, Comput. Networks.

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

[12]  J. J. Aceves-Luna-Garcia.  Routing management in very large-scale networks , 1988 .

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

[14]  A. Khanna,et al.  Reducing Routing Overhead in a Growing DDN , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

[15]  Adrian Segall,et al.  Subtle Design Issues in the Implementation of Distributed Dynamic Routing Algorithms , 1986, Comput. Networks.

[16]  Ming-Syan Chen,et al.  Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping , 1987, IEEE Transactions on Computers.