Abstract
In this paper, we sketch structure characterization of a class of networks, called Matching Composition Networks (MCNs), to establish necessary conditions for determining the conditional fault hamiltonicity. We then apply our result to n-dimensional restricted hypercube-like networks, including n-dimensional crossed cubes, and n-dimensional locally twisted cubes, to show that there exists a fault-free Hamiltonian cycle if there are at most 2n − 5 faulty edges in which each node is incident to at least two fault-free edges. We also demonstrate that our result is worst-case optimal with respect to the number of faulty edges tolerated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akl, S.G.: Parallel Computation: Models and Methods. Prentice Hall, Englewood Cliffs (1997)
Ascheuer, N.: Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems. PhD thesis, University of Technology, Berlin, Germany (1995)
Efe, K.: The crossed cube architecture for parallel computation. IEEE Transactions on Parallel and Distributed Systems 3(5), 513–524 (1992)
Fu, J.-S.: Fault-tolerant cycle embedding in the hypercube. Parallel Comptuing 29(6), 821–832 (2003)
Fu, J.-S.: Conditional fault-tolerant hamiltonicity of star graphs. In: 7th Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), pp. 11–16. IEEE Computer Society, Los Alamitos (2006)
Fu, J.-S.: Conditional fault-tolerant hamiltonicity of twisted cubes. In: 7th Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), pp. 5–10. IEEE Computer Society, Los Alamitos (2006)
Hsieh, S.-Y., Ho, C.-W., Chen, G.-H.: Fault-free hamiltoninan cycles in faulty arrangement graphs. IEEE Transactions on Parallel and Distributed Systems 10(3), 223–237 (1999)
Hsieh, S.-Y., Chen, G.-H., Ho, C.-W.: Longest fault-free paths in star graphs with edge faults. IEEE Transactions on Computers 50(9), 960–971 (2001)
Hung, H.-S., Chen, G.-H., Fu, J.-S.: Conditional fault-tolerant cycle-embedding of crossed graphs. In: 7th Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), pp. 90–95. IEEE Computer Society, Los Alamitos (2006)
Leighton, F.T.: Introduction to parallel algorithms and architecture: arrays· trees· hypercubes. Morgan Kaufmann, San Mateo, CA (1992)
Park, J.-H., Chwa, K.-Y.: Recursive circulant: A new topology for multicomputer networks. In: Internation Symposium Parallel Architectures, Algorithms and Networks (ISPAN 1994), pp. 73–80. IEEE press, New York (1994)
Park, J.-H., Kim, H.-C., Lim, H.-S.: Fault-hamiltonicity of hypercube-like interconnection networks. In: 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), IEEE Computer Society, Los Alamitos (2005)
Tsai, C.-H.: Linear array and ring embeddings in conditional faulty hypercubes. Theoretical Computer Science 314, 431–443 (2004)
Tseng, Y.-C., Chang, S.-H., Sheu, J.-P.: Fault-tolerant ring embedding in a star graph with both link and node failures. IEEE Transactions on Parallel and Distributed Systems 8(12), 1185–1195 (1997)
Vaidya, A.S., Rao, P.S.N., Shankar, S.R.: A class of hypercube-like networks. In: 5th IEEE Symposium on Parallel and Distributed Proceeding (SPDP 1993), pp. 800–803. IEEE Press, Los Alamitos (1993)
Wang, N.-C., Chu, C.-P., Chen, T.-S.: A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks. Journal of Parallel and Distributed Computing 62(12), 1747–1762 (2002)
Wang, N.-C., Yan, C.-P., Chu, C.-P.: Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model. Journal of Systems Architecture 51(3), 165–183 (2005)
Yang, X., Evans, D.J., Megson, G.M.: The locally twisted cubes. International Journal of Computer Mathematics 82(4), 401–413 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsieh, SY., Lee, CW. (2008). Hamiltonicity of Matching Composition Networks with Conditional Edge Faults. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)