Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links

Information Sciences

Volumn 180, Issue 1, 2010, Pages 198-208

  Dong, Qiang ^a,b   Yang, Xiaofan ^a   Wang, Dajin ^b  

^a CHONGQING UNIVERSITY   (China)

^b MONTCLAIR STATE UNIVERSITY   (United States)

Author keywords

Cycle; Embedding; Fault tolerance; Interconnection networks; k Ary n cube; Path

Indexed keywords

CYCLE; EMBEDDING; FAULT-TOLERANT; FAULTY NODE; K-ARY N-CUBE; K-ARY N-CUBES; PARALLEL COMPUTING; PATH;

FAULT TOLERANCE; GRAPH THEORY; INTERCONNECTION NETWORKS; PARALLEL ARCHITECTURES; QUALITY ASSURANCE;

GEOMETRY;

EID: 70350571716     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.09.002     Document Type: Article

References (19)

1. Ashir Y.A., and Stewart I.A. Fault-tolerant embeddings of hamiltonian circuits in k-ary n-cubes. SIAM Journal on Discrete Mathematics 15 3 (2002) 317-328
2. Bose B., Broeg B., Kwon Y., and Ashir Y. Lee distance and topological properties of k-ary n-cubes. IEEE Transactions on Computers 44 8 (1995) 1021-1030
3. Chen X.-B. Many-to-many disjoint paths in faulty hypercubes. Information Sciences 179 18 (2009) 3110-3115
4. Diestel R. Graph Theory (2005), Springer-Verlag, Heidelberg, New York
5. Dong Q., Yang X., and Zhao J. Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori. Computers and Electrical Engineering (2009) 10.1016/j.compeleceng.2008.09.005
6. Fu J.-S. Hamiltonian connectivity of the WK-recursive network with faulty nodes. Information Sciences 178 12 (2008) 2573-2584
7. Ghozati S.A., and Wasserman H.C. The k-ary n-cube network: modeling, topological properties and routing strategies. Computers and Electrical Engineering 25 3 (1999) 155-168
8. S.-Y. Hsieh, T.-J. Lin, Embedding cycles and paths in a k-ary n-cube, in: Proceedings of International Conference on Parallel and Distributed Systems, ICPADS'07, Hsinchu, Taiwan, 2007, pp. 1-7.
9. Hsieh S.-Y., Lin T.-J., and Huang H.-L. Panconnectivity and edge-pancyclicity of 3-ary n-cubes. Journal of Supercomputing 42 2 (2007) 225-233
10. Hung H.-S., Fu J.-S., and Chen G.-H. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Information Sciences 177 24 (2007) 5664-5674
11. H.-C. Kim, J.-H. Park, Fault hamiltonicity of two-dimensional torus networks, in: Proceedings of the Workshop on Algorithms and Computation, WAAC'00, Tokyo, Japan, 2000, pp. 110-117.
12. Kueng T.-L., Liang T., Hsu L.-H., and Tan J.M. Long paths in hypercubes with conditional node-faults. Information Sciences 179 5 (2009) 667-681
13. Parhami B. An Introduction to Parallel Processing: Algorithms and Architectures (1999), Plenum Press, New York
14. Park J.-H., Lim H.-S., and Kim H.-C. Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements. Theoretical Computer Science 377 1-3 (2007) 170-180
15. Stewart I.A., and Xiang Y. Embedding long paths in k-ary n-cubes with faulty nodes and links. IEEE Transactions on Parallel and Distributed Systems 19 8 (2008) 1071-1085
16. Tsai P.-Y., Fu J.-S., and Chen G.-H. Embedding Hamiltonian cycles in alternating group graphs under conditional fault model. Information Sciences 179 6 (2009) 851-857
17. Tsai C.-H., and Lai Y.-C. Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes. Information Sciences 177 24 (2007) 5590-5597
18. Wang H.-L., Wang J.-W., and Xu J.-M. Edge-fault-tolerant bipanconnectivity of hypercubes. Information Sciences 179 4 (2009) 404-409
19. Yang M.-C., Tan J.M., and Hsu L.H. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. Journal of Parallel and Distributed Computing 67 4 (2007) 362-368