W-Rabin numbers and strong w-Rabin numbers of folded hypercubes

Networks

Volumn 51, Issue 3, 2008, Pages 171-177

  Lai, Cheng Nan ^a   Chen, Gen Huey ^b  

^a NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Folded hypercube; Hypercube; Node disjoint paths; Optimization problem; Strong w Rabin number; W Rabin number

Indexed keywords

FOLDED HYPERCUBE; HYPERCUBE; NODE-DISJOINT PATHS; OPTIMIZATION PROBLEM; STRONG W-RABIN NUMBER; W-RABIN NUMBER;

COMPUTER NETWORKS;

EID: 51449108302     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20213     Document Type: Article

References (24)

1. B. Bollobás, Extremal graph theory, Academic Press. New York, 1978.
2. J. A Bondy and U.S.R. Murty, Graph theory with applications, North-Holland, New York, 1976.
3. F. Cao, D.Z. Du, D.F. Hsu, and S.H. Teng, Fault tolerance properties of pyramid networks, IEEE Trans Comput 48 (1999), 88-93.
4. H.Y. Chang and R.J. Chen, Incrementally extensible folded hypercube graphs, J Inf Sci Eng 16 (2000), 291-300.
5. C.C. Chen and J. Chen, Nearly optimal one-to-many parallel routing in star networks, IEEE Trans Parallel Distr Syst 8 (1997), 1196-1202.
6. W.M. Chen and G.H. Chen, Generalized diameters of the mesh of trees, Theory Comput Syst 37 (2004), 547-556.
7. S.A. Choudum and R.U. Nandini, Complete binary trees in folded and enhanced cubes, Networks 43 (2004), 266-272.
8. D.R. Duh and G.H. Chen, On the Rabin number problem, Networks 30 (1997), 219-230.
9. D.R. Duh, G.H. Chen, and J.F. Fang, Algorithms and properties of a new two-level network with folded hypercubes as basic modules, IEEE Trans Parallel Distr Syst 6 (1995), 714-723.
10. A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes, IEEE Trans Parallel Distr Syst 2 (1991), 31-42.
11. J.S. Fu, Hamiltonicity of the WK-recursive network with and without faulty nodes, IEEE Trans Parallel Distr Syst 16 (2005), 853-865.
12. S. Gao and D.F. Hsu, Short containers in Cayley graphs, Rutgers University, 2001, New Jersey.
13. Q.P. Gu and S. Peng, Fault tolerant routing in toroidal networks, Proceedings of the First Aizu International Symposium on Parallel Algorithms and Architecture Synthesis, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 162-168.
14. S. Y. Hsieh and Z.N. Guo, Hamilton-connectivity and strongly hamiltonian-laceability of folded hypercubes, Comput Math 53 (2007), 1040-1044.
15. D.F. Hsu and Y.D. Lyuu, A graph-theoretical study of transmission delay and fault tolerance, Int J Mini Microcomput 16 (1994), 35-42.
16. C.N. Lai, One-to-many disjoint paths in the hyper-cube and folded hypercube, PhD Thesis, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, 2001, http://mail.nkmu.edu.tw/~mis/lai-phd.pdf.
17. C.N. Lai and G.H. Chen, Strong Rabin numbers of folded hypercubes, Theor Comput Sci 341 (2005), 196-215.
18. S.C. Liaw and G.J. Chang, Generalized diameters and Rabin numbers of networks, J Combin Optim 4 (1999), 371-384.
19. S.C. Liaw and G.J. Chang, Rabin numbers of butterfly networks, Discrete Math 196 (1999), 219-227.
20. M.O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J ACM 36 (1989), 335-348.
21. Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Trans Comput 37 (1988), 867-872.
22. T.Y. Sung, M.Y. Lin, and T.Y. Ho, Multiple-edge-fault tolerance with respect to hypercubes, IEEE Trans Parallel Distr Syst 8 (1997), 187-192.
23. D. Wang, Embedding hamiltonian cycles into folded hypercubes with faulty links, J Parallel Distr Comput 61 (2001), 545-564.
24. J. M and M. Ma, Cycles in folded hypercubes, Appl Math Lett 19 (2006), 140-145.