Forward loop backward hop (FLBH) networks, characterized by a forward loop connecting all the adjacent nodes and a backward loop connecting nodes separated by a distance of h hops, have a higher connectivity and therefore a higher potential for fault-tolerance than single-loop networks. How to devise efficient fault-tolerant routing algorithms is an important issue on designing FLBH networks. This paper proposes two new fault-tolerant routing algorithms. One is for optimal FLBH networks with h/sup 2/=N, where N is the number of nodes. The other is for arbitrary FLBH networks (i.e., 1 >
['Pi-Rong Sheu', 'Wen-Tsuen Chen', 'Jenq-Fang Chiou']
Efficient fault-tolerant routing algorithms for forward loop backward hop networks