Substar Reliability Analysis in Star Networks

In this paper, we derive an upper bound on the (n-1)-star reliability in an S"n using the probability fault model. Approximate (n-1)-star reliability results are also obtained using the fixed partitioning. The numerical results show that the (n-1)-star reliabilities under the probability fault model and the fixed partitioning are in good agreement especially for the low value of the node reliability. The numerical results are also shown to be consistent with and close to the simulation results. Conservative comparisons are made where possible between the reliability of similar size star graphs and hypercubes.

[1]  Sun-Yuan Hsieh,et al.  Embedding longest fault-free paths onto star graphs with more vertex faults , 2005, Theor. Comput. Sci..

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

[3]  Roy Billinton,et al.  Reliability Evaluation of Engineering Systems , 1983 .

[4]  Shahram Latifi,et al.  A Combinatorial Analysis of Distance Reliability in Star Network , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[5]  Pradip K. Srimani,et al.  Topological properties of star graphs , 1993 .

[6]  Shahram Latifi,et al.  On Embedding Rings into a Star-Related Network , 1997, Inf. Sci..

[7]  Nader Bagherzadeh,et al.  Embedding an Arbitrary Binary Tree into the Star Graph , 1996, IEEE Trans. Computers.

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

[9]  Hamid Sarbazi-Azad,et al.  Fault-tolerant routing in the star graph , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[10]  Abdel Elah Al-Ayyoub,et al.  Reliable communication in faulty star networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

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

[12]  Satoshi Fujita A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model , 1999, IEEE Trans. Computers.

[13]  Shahram Latifi,et al.  Diagnosability of star graphs under the comparison diagnosis model , 2005, Inf. Process. Lett..

[14]  Rajib K. Das Adaptive Fault Tolerant Routing in Star Graph , 2004, IWDC.

[15]  Shahram Latifi,et al.  A robustness measure for hypercube networks , 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

[16]  Hamid Sarbazi-Azad,et al.  A comparative performance analysis of n-cubes and star graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[17]  Shahram Latifi,et al.  Markov Reliability Modeling of Star Networks , 2007, PDPTA.

[18]  Shahram Latifi,et al.  A study of fault tolerance in star graph , 2007, Inf. Process. Lett..

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

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

[21]  Chita R. Das,et al.  A Unified Task-Based Dependability Model for Hypercube Computers , 1992, IEEE Trans. Parallel Distributed Syst..

[22]  Laxmi N. Bhuyan,et al.  A Combinatorial Analysis of Subcube Reliability in Hybercubes , 1995, IEEE Trans. Computers.

[23]  Shahram Latifi,et al.  Robustness of star graph network under link failure , 2008, Inf. Sci..

[24]  Nader Bagherzadeh,et al.  A Grid Embedding into the Star Graph for Image Analysis Solutions , 1996, Inf. Process. Lett..

[25]  Jelena Misic,et al.  Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network , 1994, J. Parallel Distributed Comput..

[26]  Shahram Latifi On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..

[27]  Gen-Huey Chen,et al.  Longest Fault-Free Paths in Star Graphs with Edge Faults , 2001, IEEE Trans. Computers.

[28]  Jerry L. Trahan,et al.  Improved Lower Bounds on the Reliability of Hypercube Architectures , 1994, IEEE Trans. Parallel Distributed Syst..

[29]  Selim G. Akl,et al.  On some combinatorial properties of the star graph , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

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