Routing Algorithms to Double Loop Networks.

We give a new routing algorithm for double loop networks with n nodes which requires O (log n) time for preprocessing and constant processing time at each node on the route. A simple modification of the algorithm works for the case of a single fault (either node or link). The routing is always through a shortest path and the only information needed by a node to process is the address of the destination.