Reliable broadcast of routing information using diffusing computations

A distributed algorithm called T-DA is presented. It allows the routing nodes, of a computer network or internet to maintain the correct view of the topology, even when link costs change or the topology changes due to failures or additions of nodes or links. T-DA eliminates the need for flooding by implementing a routing algorithm based on distance vectors to broadcast link-state information reliably over spanning trees that have the shortest distances to the sources of the link-state updates. T-DA eliminates the need for auxiliary information by asking each node to trust the link states reported by the neighbor closest to the source of such information.<<ETX>>

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

[2]  Baruch Awerbuch,et al.  A reliable broadcast protocol , 1982, CDC 1982.

[3]  S. Finn.  Resynch Procedures and a Fail-Safe Network Protocol , 1979, IEEE Trans. Commun..

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

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

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

[7]  Pierre A. Humblet,et al.  Topology Broadcast Algorithms , 1989, Comput. Networks.

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

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

[10]  Robert G. Gallager,et al.  Event driven topology broadcast without sequence numbers , 1989, IEEE Trans. Commun..

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

[12]  Uzi Vishkin.  An efficient distributed orientation algorithm , 1983, IEEE Trans. Inf. Theory.

[13]  Pierre A. Humblet,et al.  Distributed network protocols for changing topologies: a counterexample , 1991, IEEE Trans. Commun..

[14]  J. J. Garcia-Luna-Aceves.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM 1989.

[15]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

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

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