Dynamics of distributed shortest-path routing algorithms
- 1 August 1991
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 21 (4), 31-42
- https://doi.org/10.1145/115992.115997
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A loop-free extended Bellman-Ford routing protocol without bouncing effectACM SIGCOMM Computer Communication Review, 1989
- A unified approach to loop-free routing using distance vectors or link statesACM SIGCOMM Computer Communication Review, 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
- Subtle design issues in the implementation of distributed, dynamic routing algorithmsComputer Networks and ISDN Systems, 1986
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959