Title :
Another adaptive distributed shortest path algorithm
Author :
Humblet, Pierre A.
Author_Institution :
Lab. for Inf. & Decision Syst., MIT, Cambridge, MA, USA
fDate :
6/1/1991 12:00:00 AM
Abstract :
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
Keywords :
adaptive systems; distributed processing; network topology; switching networks; adaptive distributed shortest path algorithm; changing network topology; distributed processing; message complexities; time complexity; Computer networks; Convergence; Distributed algorithms; Distributed computing; Distributed processing; Network topology; Routing; Societies;
Journal_Title :
Communications, IEEE Transactions on
