Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks

Author(s):  
Liu Hui ◽  
Shengling Wang
2007 ◽  
Vol 381 (1-3) ◽  
pp. 68-85 ◽  
Author(s):  
Domingo Gómez ◽  
Jaime Gutierrez ◽  
Álvar Ibeas

1994 ◽  
Vol 2 (4) ◽  
pp. 363-373 ◽  
Author(s):  
J.M. Peha ◽  
F.A. Tobagi

1997 ◽  
Vol 07 (03) ◽  
pp. 259-265 ◽  
Author(s):  
F. K. Hwang ◽  
Tzai-Shunne Lin ◽  
Rong-Hong Jan

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.


1998 ◽  
Vol 66 (4) ◽  
pp. 201-207 ◽  
Author(s):  
Ting-Yi Sung ◽  
Chun-Yuan Lin ◽  
Yen-Chu Chuang ◽  
Lih-Hsing Hsu

2001 ◽  
Vol 50 (5) ◽  
pp. 500-505 ◽  
Author(s):  
Yu-Liang Liu ◽  
Yue-Li Wang ◽  
D.J. Guan

2000 ◽  
Vol 49 (9) ◽  
pp. 977-979 ◽  
Author(s):  
Chiuyuan Chen ◽  
F.K. Hwang

Sign in / Sign up

Export Citation Format

Share Document