Fault tolerant token ring embedding in double loop networks

Information Processing Letters ◽

10.1016/s0020-0190(98)00066-0 ◽

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 ◽

Double Loop Networks

Download Full-text

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

IEEE Transactions on Computers ◽

10.1109/12.926162 ◽

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

Download Full-text

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

IEEE Transactions on Parallel and Distributed Systems ◽

10.1109/tpds.2005.103 ◽

2005 ◽

Vol 16 (9) ◽

pp. 841-852 ◽

Author(s):

H.P. Dharmasena ◽

X. Yan

Keyword(s):

Fault Tolerant ◽

Routing Algorithm ◽

Double Loop ◽

Double Loop Networks

Download Full-text

Erratum to “A dynamic fault-tolerant message routing algorithm for double-loop networks”, Information Processing Letters 70 (1999) 259–264

Information Processing Letters ◽

10.1016/s0020-0190(99)00134-9 ◽

1999 ◽

Vol 71 (5-6) ◽

pp. 241

Author(s):

Chun-yen Chou ◽

D.J. Guan ◽

Kuei-lin Wang

Keyword(s):

Information Processing ◽

Fault Tolerant ◽

Routing Algorithm ◽

Double Loop ◽

Message Routing ◽

Double Loop Networks

Download Full-text

Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks

Theoretical Computer Science ◽

10.1016/j.tcs.2012.11.008 ◽

2013 ◽

Vol 468 ◽

pp. 50-58 ◽

Author(s):

Yebin Chen ◽

Ying Li ◽

Tao Chen

Keyword(s):

Fault Tolerant ◽

Routing Algorithm ◽

Double Loop ◽

Double Loop Networks

Download Full-text

A dynamic fault-tolerant message routing algorithm for double-loop networks

Information Processing Letters ◽

10.1016/s0020-0190(99)00072-1 ◽

1999 ◽

Vol 70 (6) ◽

pp. 259-264 ◽

Author(s):

Chun-yen Chou ◽

D.J. Guan ◽

Kuei-lin Wang

Keyword(s):

Fault Tolerant ◽

Routing Algorithm ◽

Double Loop ◽

Message Routing ◽

Double Loop Networks

Download Full-text

Fault-tolerant routing in a class of double loop networks

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? ◽

10.1109/infcom.1988.12926 ◽

2003 ◽

Author(s):

Khiem Van Le ◽

C.S. Raghavendra

Keyword(s):

Fault Tolerant ◽

Double Loop ◽

Double Loop Networks

Download Full-text

Research on the Diameter and Average Diameter of Undirected Double-loop Networks

2010 Ninth International Conference on Grid and Cloud Computing ◽

10.1109/gcc.2010.95 ◽

2010 ◽

Author(s):

Bian Qiong-Fang ◽

Hang Ting-ting ◽

Liu Hui ◽

Fang Mu-yun

Keyword(s):

Average Diameter ◽

Double Loop ◽

Double Loop Networks

Download Full-text

Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks

Wireless Algorithms, Systems, and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-030-23597-0_48 ◽

2019 ◽

pp. 587-595

Author(s):

Liu Hui ◽

Shengling Wang

Keyword(s):

Optimal Routing ◽

Double Loop ◽

Double Loop Networks

Download Full-text

Analyzing the fault tolerance of double-loop networks

IEEE/ACM Transactions on Networking ◽

10.1109/90.330417 ◽

1994 ◽

Vol 2 (4) ◽

pp. 363-373 ◽

Author(s):

J.M. Peha ◽

F.A. Tobagi

Keyword(s):

Fault Tolerance ◽

Double Loop ◽

Double Loop Networks

Download Full-text

A Permutation Routing Algorithm for Double Loop Networks

Parallel Processing Letters ◽

10.1142/s0129626497000279 ◽

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.

Download Full-text