## Another Adaptive Distributed Shortest Path Algorithm (1991)

Venue: | IEEE Transactions on Communications |

Citations: | 42 - 0 self |

### BibTeX

@ARTICLE{Humblet91anotheradaptive,

author = {Pierre A. Humblet},

title = {Another Adaptive Distributed Shortest Path Algorithm},

journal = {IEEE Transactions on Communications},

year = {1991},

volume = {39},

pages = {995--1003}

}

### OpenURL

### Abstract

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 FordBellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge MA 02139. This research was supported in part by Codex Corporation and in part by the Army Research Office under Grant No. DAAL03-86-K-0171. 2 1) INTRODUCTION One of the oldest and best known problems in the field of distributed algorithms is to compute shortest paths between nodes in a network. This problem arises in the following context. We have a network of links and nodes (processors). Each link (I,J) is characterized by a direction dependent length LEN(I,J) that can change with time and can only be observed at node I. The nodes execute a distr...