An adaptive distributed Dijkstra shortest path algorithm
P.A. Humblet, Decision Systems. · 1988
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated.