Event driven topology broadcast without sequence numbers

An algorithm is presented that allows each node in a computer network to maintain a correct view of the network topology despite link and node failures. Reliability is achieved without transmitting any information other than the operational status of links. Messages are only sent in response to topological changes: periodic retransmission is not required. >

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

[2]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

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

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

[5]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[6]  Eric C. Rosen,et al.  Vulnerabilities of network control protocols: an example , 1981, CCRV.

[7]  Baruch Awerbuch,et al.  "A reliable broadcast protocol" , 1982, 1982 21st IEEE Conference on Decision and Control.

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

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

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

[11]  Adrian Segall,et al.  Reliable link initialization procedures , 1988, IEEE Trans. Commun..