Node-Disjoint Paths and Related Problems on Hierarchical Cubic Networks

Networks

Volumn 40, Issue 3, 2002, Pages 142-154

  Fu, Jung Sheng ^a   Chen, Gen Huey ^b   Duh, Dyi Rong ^c  

^a NATIONAL UNITED UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Container; Fault diameter; Hierarchical cubic network; Node disjoint paths; Wide diameter

Indexed keywords

CONSTRAINT THEORY; CONTAINERS; THEOREM PROVING;

NODE-DISJOINT PATHS;

HIERARCHICAL SYSTEMS;

EID: 0141541617     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10040     Document Type: Article

References (21)

1. F. Buckley and F. Harary, Distance in graphs, AddisonWesley, New York, 1990.
2. C.C. Chen and J. Chen, Optimal parallel routing in star networks, IEEE Trans Comput 46 (1997), 1293-1303.
3. W.K. Chiang and R.J. Chen, Topological properties of hierarchical cubic networks, J Syst Arch 42 (1996), 289-307.
4. K. Day and A.E. Al-Ayyoub, Fault diameter of k-ary n-cube networks, IEEE Trans Parallel Distrib Syst 8 (1997), 903-907.
5. K. Day and A. Tripathi, Characterization of node disjoint paths in arrangement graphs, Technical Report TR 91-43, Computer Science Department, University of Minnesota, 1991.
6. M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, Three disjoint path paradigms in star networks, Proc IEEE Symp Parallel and Distributed Processing, 1991, pp. 400-406.
7. D.R. Duh and G.H. Chen, Topological properties of WK-recursive networks, J Parallel Distrib Comput 23 (1994), 468-474.
8. D.R. Duh, G.H. Chen, and D.F. Hsu, Combinatorial properties of generalized hypercube graphs, Info Process Lett 57 (1996), 41-45.
9. J.S. Fu, A study on hierarchical cubic networks, Ph.D. Thesis, Department of Computer Science and Information Engineering, National Taiwan University, Nov. 2001.
10. J.S. Fu, G.H. Chen, and D.R. Duh, Node-disjoint paths and related problems on hierarchical cubic networks, Technical Report NTUCSIE 00-03, Department of Computer Science and Information Engineering, National Taiwan University, 2000 (also available at http://www.csie.ntu.edu.tw/̃gh-chen).
11. K. Ghose and K.R. Desai, Hierarchical cubic networks, IEEE Trans Parallel Distrib Syst 6 (1995), 427-435.
12. D.F. Hsu, On container width and length in graphs, groups, and networks, IEICE Trans Fundam Elect Commun Comput Sci E77-A (1994), 668-680.
13. H.L. Huang and G.H. Chen, Combinatorial properties of two-level hypernet networks, IEEE Trans Parallel Distrib Syst 10 (1999), 1192-1199.
14. M.S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks, Comput Math Appl 13 (1987), 577-582.
15. S. Latifi, Combinatorial analysis of the fault-diameter of the n-cube, IEEE Trans Comput 42 (1993), 27-33.
16. S.C. Liaw, G.J. Chang, F. Cao, and D.F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks, Ann Combin 2 (1998), 165-172.
17. M.O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J ACM 36 (1989), 335-348.
18. Y. Rouskov and P.K. Srimani, Fault diameter of star graphs, Info Process Lett 48 (1993), 243-251.
19. Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Trans Comput 37 (1988), 867-872.
20. S.K. Yun and K.H. Park, The optimal routing algorithm in hierarchical cubic network and its properties, IEICE Trans Info Syst E78-D (1995), 436-443.
21. S.K. Yun and K.H. Park, Comments on hierarchical cubic networks, IEEE Trans Parallel Distrib Syst 9 (1998), 410-414.