A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks

Lecture Notes in Computer Science - Mobile Ad-hoc and Sensor Networks ◽

10.1007/11599463_31 ◽

2005 ◽

pp. 308-316

Author(s):

Bao-Xing Chen ◽

Ji-Xiang Meng ◽

Wen-Jun Xiao

Keyword(s):

Routing Algorithm ◽

Constant Time ◽

Optimal Routing ◽

Double Loop ◽

Time Optimal ◽

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

A Permutation Routing Algorithm for Double Loop Networks

Parallel Processing Letters ◽

10.1142/s0129626497000279 ◽

1997 ◽

Vol 07 (03) ◽

pp. 259-265 ◽

Cited By ~ 8

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

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 ◽

Cited By ~ 9

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 ◽

Cited By ~ 7

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 ◽

Cited By ~ 5

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 ◽

Cited By ~ 8

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

ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054192000188 ◽

1992 ◽

Vol 03 (03) ◽

pp. 323-331 ◽

Cited By ~ 7

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.

Download Full-text