Another adaptive distributed shortest path algorithm

P.A. Humblet · IEEE Transactions on Communications · 1991

The authors give a distributed algorithm to compute shortest paths in a network with changing topology. The authors analyze its behavior. The proof of correctness is discussed. 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. Comparisons with other methods are given.>

Cited by 116 works. doi:10.1109/26.87189

Authors

References