Skip to Main Content
A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures, the algorithm can send a packet along the shortest path to destination; when there are failures, the packet can bypasss failed nodes and links.