Efficient Broadcasting on Faulty Star Networks

We propose a non-adaptive single-port broadcasting scheme for star graphs. Broadcasting in the n-star graph by the scheme can tolerate O(√n log n) faults, and it is completed in O(n log n) time.

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

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

[3]  Pradip K. Srimani,et al.  Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..

[4]  Sheldon B. Akers,et al.  On Group Graphs and Their Fault Tolerance , 1987, IEEE Transactions on Computers.

[5]  Yoshihide Igarashi,et al.  Optimal Time Broadcasting in Faulty Star Networks , 1996, WDAG.

[6]  David Peleg.  A Note on Optimal Time Broadcast in Faulty Hypercubes , 1995, J. Parallel Distributed Comput..

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

[8]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

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

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

[11]  Andrzej Pelc.  Fault‐tolerant broadcasting and gossiping in communication networks , 1996 .

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

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

[14]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.