Another adaptive distributed shortest path algorithm
- 1 June 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (6), 995-1003
- https://doi.org/10.1109/26.87189
Abstract
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford- Bellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated.Keywords
This publication has 16 references indexed in Scilit:
- A distributed, loop-free, shortest-path routing algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Burroughs integrated adaptive routing system (BIAS TM )ACM SIGCOMM Computer Communication Review, 1987
- Updating routing tables after resource failure in a distributed computer networkNetworks, 1984
- A Distributed Routing Design for a Broadcast EnvironmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977
- A Routing Procedure for the TIDAS Message-Switching NetworkIEEE Transactions on Communications, 1975
- A Note on Dijkstra's Shortest Path AlgorithmJournal of the ACM, 1973