论文信息 - The Effect of Node Failures in Substar Reliability of a Star Network- a Combinatorial Approach

The Effect of Node Failures in Substar Reliability of a Star Network- a Combinatorial Approach

The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.

Shahram Latifi | Venka Palaniappan | S. Latifi | Venka Palaniappan

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

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

[3] Jang-Ping Sheu,et al. A Fault-Tolerant Reconfiguration Scheme in the Faulty Star Graph , 2000, J. Inf. Sci. Eng..

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

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

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

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

[8] D J Evans,et al. Parallel processing , 1986 .

[9] 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).

[10] Pradip K. Srimani,et al. A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network , 1991, ICPP.

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