FAILSAFE DISTRIBUTED LOOP - FREE ROUTING IN COMMUNICATION NETWORKS.

Several algorithms for routing of information in communication networks are presented. All protocols are characterized by distributed computation, loop-freedom in the routing tables for each destination in the network, adaptability to changes in flow requirements and immunity in face of arbitrary number, location and timing of topological changes. Two algorithms converge to the minimum delay routing in message and line-switched networks respectively. A third, somewhat simpler algorithm, maintains at any given time only one route between each pair of nodes in the network and converges to the shortest paths between each source and each destination in terms of arbitrary weights on the links.