Distributed routing using internodal coordination

Abstract

A distributed algorithm for the dynamic calculation of the shortest paths in a computer network is introduced. The algorithm is loop-free at every instant of time independently of the transmission and processing delays in the network or the changes in the topology. According to the algorithm, each node maintains the length of the shortest paths to each network destination; update messages from a node are sent only to its neighbors. It extends the Jaffe-Moss algorithm by allowing nodes to choose new successors to destinations with no need for internodal coordination after link cost increases if the new successors are considered to be at most at the same distance as the current successors. A complete description of the algorithms is listed.<>