A Responsive Distributed Routing Algorithm for Computer Networks
- 1 July 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 30 (7) , 1758-1762
- https://doi.org/10.1109/tcom.1982.1095632
Abstract
A new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks. The major features of the algorithm are that the paths defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms. Specifically, the worst case recovery time is proportional to the largest number of hops h in any of the weighted shortest paths. For previous loop-free distributed algorithms this recovery time is proportional to h2.Keywords
This publication has 5 references indexed in Scilit:
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Routing Techniques Used in Computer Communication NetworksIEEE Transactions on Communications, 1980
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979
- A Review of the Development and Performance of the ARPANET Routing AlgorithmIEEE Transactions on Communications, 1978
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977