The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
E-mail: 9707318@mail.dyu.edu.tw
ABSTRACT
The star graph is a famous interconnection networks. In this paper, we discuss the edge fault tolerance for 2-pair spanning property for star graph. Let Sn = (V1 ?y V2, E) be the n-dimensional star graph. We will show that there exist two spanning disjoint paths P(x1, y1) and P(x2, y2) of Sn ? Fe for any x1, x2 ? V1, y1, y2 ? V2 and Fe ?} E with |Fe| ?T n ? 4, n ?d 5. We also show that there exist two spanning disjoint paths P(x1, y1) and P(x2, y2) of Sn ? Fe for any x1, y1 ? V1, x2, y2 ? V2 and Fe ?} E with |Fe| ?n?T n ? 4, n ?n?d 5. The number of faulty edges is optimal. Additionally, we also discuss the base case of geodesic Hamiltonian laceable in star and hypercube.
Keywords : star graph ; fault tolerance ; spanning disjoint path
Table of Contents
授權...iii 英文摘要...Iv 中文摘 要...v 誌謝...vi 目
錄...vii 圖目錄...viii Chapter 1 Introduction ...1 Chapter 2 Definitions and Notation...3 Chapter 3 Edge fault tolerance for two spanning paths in Star graph...5 Chapter 4 Related work...28 Chapter 5
Conclusion...32 REFERENCES
1] S.B. Akers, D. Harel, B. Krishnamurthy, ”The star graph: an attractive alternative to the n-cube”, Proc. Internat. Conf. Parallel Processing, pp. 393-400, 1987.
[2] SHELDON B. AKERS, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Transactions on Computers, pp.555-566, 1989.
[3] R. Balakrishnan,K. Ranganathan, “A Textbook of Graph Theory,” [4] H. C. Chan, J. M. Chang, Y. L. Wang, and S. J. Horng,
”Geodesic-pancyclic graphs”, Discrete Applied Mathematics 155(15), pp, 1971-1978, 2007 [5] Shou-Yi Cheng, Jen-Hui Chuang, “Varietal Hypercube-A New Interconnection Net- work Topology for Large Scale Multicomputer,” IEEE Transactions on Computers, pp.0-8186-655-6, 1994 [6] J. Duato, S. Yalamanchili, L. Ni, ”Interconnection Networks: An Engineering Ap- proach”, IEEE Computer Society Press, 2003.
[7] K. Efe, ”A variation on the hypercube with lower diameter”, IEEE Transactions on Computers, pp. 1213-1316, 1991.
[8] S. Gao, B. Novick and K. Qiu, ”From hall’s matching theorem to optimal routing on hypercubes,” Journal of Combinatorial Theory, pp.
291-301, 1998.
[9] Sun-Yuan Hsieh, ”Embedding Longest Fault-Free Paths onto Star Graphs with More Vertex Faults,” Theortical Computer Science, pp.
370-378, 2005.
[10] Sun-Yuan Hsieh, Gen-Huey Chen, and Chin-Wen Ho, ”Longest fault-free paths in Star Graphs with Vertex Faults,” Theoretical Computer Science, pp. 215-227, 2001.
[11] Sun-Yuan Hsieh, Gen-Huey Chen, and Chin-Wen Ho, ”Longest fault-free paths in star graphs with edge faults,” IEEE Transactions on Computers, pp. 960-971, 2001.
[12] H.-C Hsu, P.L. Lai, and H.-L. Huang, ”Geodesic pancyclicity and balanced pan- cyclicity of augmented cubes,” Imformation Processing Letters 101(6), pp. 227-232, 2007.
[13] Chun-Nan Hung and Guan-Yu Shi, ”Vertex fault tolerance for multiple spanning paths in hypercube,” Processing of the 24rd Workshop on Combinatorial Mathe- matics and Computational Theory, pp.241-250, 2007.
[14] Chun-Nan Hung and Chun-Nan Wang, ”The Study of Two Spanning Disjoint Paths of Star Networks.” Dayeh University Imformation engineering [15] P.L. Lai, H.-C Hsu, and C.-H. Tsai, ”On the geodesic pancyclicity of crossed cubes,” WSEAS Transactions on Circuits and Systems 5(12), pp. 183-1810, 2006.
[16] F. T. Leighton, “Parallel Algorithms and Architectures:Arrays,Trees and Hyper- cubes,” Morgan Kaufmann, San Mateo, 1992.
[17] Hsien-Yang Liao, Chien-Hung Huang, ”The Geodesic Bipancyclic of the Hyper- cube.” The 25th Workshop on Combinatorial Mathematics and Computation The- ory., pp. 101-107, 2008 [18] Tseng-Kuei Li, Jimmy J.M. Tan and Lih-Hsing Hsu, “Hyper hamiltonian laceabil- ity on edge fault star graph,” Information Sciences, pp. 59-71, 2004.
[19] C. K. Lin, H. M. Huang, and L. H. Hsu,“The super connectivity of the pancake graphs and the super laceability of the star graphs,”
Theoretical Computer Science, pp. 257-271, 2005.
[20] S. Madhavapeddy, I. H. Sudborough, “A topological property of hypercubes: node disjoint paths,” Proc. of the 2th IEEE Symposium on Parallel and Distributed Pro- cessing, pp. 532-539, 1990.
[21] M. Noakes, W.J. Dally, ”System design of the J -machine, in: Proceedings of the Advanced Research in VLSI”, pp. 179!V192, 1990.
[22] C. D. Park and K. Y. Chwa, ”Hamiltonian properties on the class of hypercube-like networks,” Information Processing Letters, pp.11-17, 2004.
[23] Y. Saad and M. H. Schultz, “Topological properties of hypercubes,” IEEE Trans- actions on Computers, pp. 867-872, 1998.
[24] Wen-Yan Su, and Chun-Nan Hung, ”The longest ring embedding in faulty hy- percube,” The 23rd Workshop on Combinatorial Mathematics and Computation Theory, ] pp. 262-272, 2006.
[25] Chao-Ming Sun, ”Path and Cycle Embedding in Faulty Hypercubes,” 2005.
[26] C. H. Tsai, J.J.M. Tan, T.Liang, and L.H.Hsu, ”Fault-tolerant Hamiltonian lace- ability of hypercubes,” Information Processing Letters, pp.301-306, (2002).
[27] Chun-Yen Yang, Chun-Nan Hung, ”Adjacent Vertices Fault Tolerance Hamilto- nian Laceability of Star Graphs” The 23rd Workshop on Combinatorial Mathemat- ics and Computation Theory, pp.
