Israel Cidon, Jeffrey M. Jaffe, et al.
IEEE Transactions on Software Engineering
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. Copyright © 1982 by The Institute of Electrical and Electronics Engineers, Inc.
Israel Cidon, Jeffrey M. Jaffe, et al.
IEEE Transactions on Software Engineering
Jeffrey M. Jaffe
PODC 1982
Jeffrey M. Jaffe, Adrian Segall
SIGCOMM 1984
Jeffrey M. Jaffe
Journal of the ACM