The minimum distance diagram of double-loop networks

2000 ◽  
Vol 49 (9) ◽  
pp. 977-979 ◽  
Author(s):  
Chiuyuan Chen ◽  
F.K. Hwang
Keyword(s):  
Minimum Distance ◽  
Double Loop ◽  
Double Loop Networks

scholarly journals Analyzing the fault tolerance of double-loop networks

1994 ◽  
Vol 2 (4) ◽  
pp. 363-373 ◽  
Author(s):  
J.M. Peha ◽  
F.A. Tobagi
Keyword(s):  
Fault Tolerance ◽  
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

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

EQUIVALENT L-SHAPES OF DOUBLE-LOOP NETWORKS FOR THE DEGENERATE CASE

2000 ◽  
Vol 01 (01) ◽  
pp. 47-60 ◽  
Author(s):  
CHIUYUAN CHEN ◽  
F. K. HWANG
Keyword(s):  
Local Area Networks ◽  
Local Area ◽  
Degenerate Case ◽  
Algebraic Operation ◽  
Double Loop ◽  
Nondegenerate Case ◽  
Distance Properties ◽  
Double Loop Networks ◽  
Geometric Operation

Double-loop networks have been widely studied as architecture for local area networks. The L-shape is an important tool for studying the distance properties of double-loop networks. Two L-shapes are equivalent if the numbers of nodes k steps away from the origin are the same for every k. Hwang and Xu first studied equivalent L-shapes through a geometric operation called a 3-rectangle transformation. Rödseth gave an algebraic operation, which was found by Huang, Hwang and Liu to correspond to the 3-rectangle transformation. Recently, Chen and Hwang obtained all equivalent transformations for the nondegenerate case. In this paper, we do the same for the degenerate case.

Sign in / Sign up

Export Citation Format

Share Document