A Responsive Distributed Routing Algorithm for Computer Networks
Jeffrey M. Jaffe, Franklin H. Moss · IEEE Transactions on Communications · 1982
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 hopshin any of the weighted shortest paths. For previous loop-free distributed algorithms this recovery time is proportional toh2.
Cited by 186 works. doi:10.1109/tcom.1982.1095632
Authors
References
- The New Routing Algorithm for the ARPANET
- A Failsafe Distributed Routing Protocol
- Routing Techniques Used in Computer Communication Networks
- A correctness proof of a topology information maintenance protocol for a distributed computer network
- A Review of the Development and Performance of the ARPANET Routing Algorithm