Design and analysis of fault-tolerant star networks

The star graph has been proposed as an attractive alternative to the hypercube offering a lower degree, a smaller diameter, and a smaller distance for a similar number of nodes. In this paper, we investigate the fault-tolerant design for the Star interconnection network using modules called fault tolerant building blocks (FTBBs). Each FTBB module contains several primary and few spare nodes. The spare nodes within each FTBB can replace the primary nodes when a failure occurs. If each spare node within an FTBB can replace any primary node we ascribe the situation to fall spare utilization. We propose fault tolerant Star networks constructed from smaller FTBBs with full spare utilization and a fault-tolerant routing scheme to reconfigure the system when a failure occurs.

[1]  Rami G. Melhem,et al.  An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

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

[3]  Chungti Liang,et al.  Performance evaluation of fault-tolerant routing on star networks , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

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

[5]  Wei-Tek Tsai,et al.  Distributed fault-tolerant routing on hypercubes algorithms and performance study , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[6]  Vinod K. Agarwal,et al.  A Fault-Tolerant Modular Architecture for Binary Trees , 1986, IEEE Transactions on Computers.