A loop-free extended Bellman-Ford routing protocol without bouncing effect
- 1 August 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 19 (4) , 224-236
- https://doi.org/10.1145/75246.75269
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A unified approach to loop-free routing using distance vectors or link statesPublished by Association for Computing Machinery (ACM) ,1989
- A minimum-hop routing algorithm based on distributed informationComputer Networks and ISDN Systems, 1989
- Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type LoopingIEEE Transactions on Computers, 1987
- Reliable broadcast protocols in unreliable networksNetworks, 1986
- A routing algorithm for interconnected local area networksComputer Networks and ISDN Systems, 1985
- An algorithm for distributed computation of a spanningtree in an extended LANPublished by Association for Computing Machinery (ACM) ,1985
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- The ARPA network design decisionsComputer Networks (1976), 1977
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959