ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
Yufei Cheng, F. K. Hwang, Ian Fuat Akyildiz, D. Frank Hsu · International Journal of Foundations of Computer Science · 1992
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.