Event driven topology broadcast without sequence numbers
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 37 (5) , 468-474
- https://doi.org/10.1109/26.24597
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Fault-tolerant broadcast of routing informationComputer Networks (1976), 1983
- An efficient distributed orientation algorithm (Corresp.)IEEE Transactions on Information Theory, 1983
- A Reliable Broadcast ProtocolIEEE Transactions on Communications, 1983
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- Distributed Minimum Hop AlgorithmsPublished by Defense Technical Information Center (DTIC) ,1982
- Vulnerabilities of network control protocolsACM SIGCOMM Computer Communication Review, 1981
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974
- A note on two problems in connexion with graphsNumerische Mathematik, 1959