Fault-free longest paths in star networks with conditional link faults

The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two or more fault-free links, we show that an n-dimensional star network can tolerate up to 2n-7 link faults, and be strongly (fault-free) Hamiltonian laceable, where n>=4. In other words, we can embed a fault-free linear array of length n!-1 (n!-2) in an n-dimensional star network with up to 2n-7 link faults, if the two end nodes belong to different partite sets (the same partite set). The result is optimal with respect to the number of link faults tolerated. It is already known that under the random fault model, an n-dimensional star network can tolerate up to n-3 faulty links and be strongly Hamiltonian laceable, for n>=3.

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2]  Gen-Huey Chen,et al.  Longest fault-free paths in star graphs with vertex faults , 2001, Theor. Comput. Sci..

[3]  Khaled Day,et al.  The Conditional Node Connectivity Of The k-Ary n-Cube , 2004, J. Interconnect. Networks.

[4]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[5]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[6]  Abdel Elah Al-Ayyoub,et al.  Fault Diameter of k-ary n-cube Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  Jie Wu.  Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes , 1995, IEEE Trans. Computers.

[8]  Jie Wu,et al.  Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets , 1998, IEEE Trans. Computers.

[9]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[10]  Shahram Latifi,et al.  Conditional Fault Diameter of Star Graph Networks , 1996, J. Parallel Distributed Comput..

[11]  Jung-Sheng Fu,et al.  Conditional Fault-Tolerant Hamiltonicity of Star Graphs , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[12]  Wei-Tek Tsai,et al.  Fault-Tolerant Multicasting on Hypercubes , 1994, J. Parallel Distributed Comput..

[13]  Jimmy J. M. Tan,et al.  Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..

[14]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[15]  Yaagoub Ashir,et al.  Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes , 2002, SIAM J. Discret. Math..

[16]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[17]  Krzysztof Diks,et al.  Efficient Gossiping by Packets in Networks with Random Faults , 1996, SIAM J. Discret. Math..

[18]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[19]  Shahram Latifi.  Combinatorial Analysis of the Fault-Diameter of the n-cube , 1993, IEEE Trans. Computers.

[20]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[21]  Selim G. Akl,et al.  Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..

[22]  M. Lewinter,et al.  Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .

[23]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[24]  Shahram Latifi,et al.  Conditional Connectivity Measures for Large Multiprocessor Systems , 1994, IEEE Trans. Computers.

[25]  Zevi Miller,et al.  Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group , 1994, IEEE Trans. Computers.

[26]  Gen-Huey Chen,et al.  Hamiltonian‐laceability of star graphs , 2000 .

[27]  Jimmy J. M. Tan,et al.  Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs , 2004, IEEE Transactions on Computers.

[28]  Zhang Yi,et al.  Restricted connectivity and restricted fault diameter of some interconnection networks , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[29]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[30]  Shahram Latifi,et al.  A Routing and Broadcasting Scheme on Faulty Star Graphs , 1993, IEEE Trans. Computers.

[31]  Chang-Hsiung Tsai.  Linear array and ring embeddings in conditional faulty hypercubes , 2004, Theor. Comput. Sci..

[32]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[33]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.

[34]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.