论文信息 - A study of fault tolerance in star graph - 字舞流文

A study of fault tolerance in star graph

The bounds on f(n,k), the number of faulty nodes to make every (n-k)-dimensional substar S"n"-"k in an n-dimensional star network S"n, have been derived. The exact value for f(n,k) is determined when n is prime and k=2, or when n-2=

Shahram Latifi | S. Latifi

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

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

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

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

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

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

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