An optimal fault-tolerant routing algorithm for double-loop networks

2001 ◽  
Vol 50 (5) ◽  
pp. 500-505 ◽  
Author(s):  
Yu-Liang Liu ◽  
Yue-Li Wang ◽  
D.J. Guan
Keyword(s):  
Fault Tolerant ◽  
Routing Algorithm ◽  
Double Loop ◽  
Double Loop Networks

A Permutation Routing Algorithm for Double Loop Networks

1997 ◽  
Vol 07 (03) ◽  
pp. 259-265 ◽  
Author(s):  
F. K. Hwang ◽  
Tzai-Shunne Lin ◽  
Rong-Hong Jan
Keyword(s):  
Parallel Processing ◽  
Routing Algorithm ◽  
Double Loop ◽  
Processing Capability ◽  
Permutation Routing ◽  
Double Loop Networks

Double-loop networks are popular architectures for interconnecting networks. We show that these networks have parallel processing capability by giving the first permutation routing algorithm. Furthermore, we show that the number of routing steps required is equal to the diameter of the network, the best bound one can get.

Fault tolerant token ring embedding in double loop networks

1998 ◽  
Vol 66 (4) ◽  
pp. 201-207 ◽  
Author(s):  
Ting-Yi Sung ◽  
Chun-Yuan Lin ◽  
Yen-Chu Chuang ◽  
Lih-Hsing Hsu
Keyword(s):  
Fault Tolerant ◽  
Double Loop ◽  
Token Ring ◽  
Double Loop Networks

ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS

1992 ◽  
Vol 03 (03) ◽  
pp. 323-331 ◽  
Author(s):  
Y. CHENG ◽  
F.K. HWANG ◽  
I.F. AKYILDIZ ◽  
D.F. HSU
Keyword(s):  
Shortest Path ◽  
Processing Time ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Double Loop ◽  
Simple Modification ◽  
Single Fault ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document