A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model

IEEE Transactions on Computers

Volumn 48, Issue 10, 1999, Pages 1123-1126

  Fujita, Satoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Broadcast; Fault tolerant; Single port half duplex model; Star graph

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; MATHEMATICAL MODELS;

FAULT-TOLERANT BROADCAST METHODS; SINGLE-PORT HALF-DUPLEX MODELS; STAR GRAPH;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0033204517     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.805160     Document Type: Article

References (16)

1. S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
2. S.G. Akl and K. Qiu, "Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry," Networks, vol. 23, pp. 215-225, 1993.
3. S.G. Akl and K. Qiu, "A Novel Routing Scheme on the Star and Pancake Networks and Its Applications," Parallel Computing, vol. 19, pp. 95-101, 1993.
4. S.G. Akl, Parallel Computation: Models and Methods. Upper Saddle River, N.J.: Prentice Hall, 1997.
5. N. Bagherzadeh, N. Nassif, and S. Latifi, "A Routing and Broadcasting Scheme on Faulty Star Graphs," IEEE Trans. Computers, vol. 42, no. 11, pp. 1,398-1,403, Nov. 1993.
6. P. Fragopoulou and S.G. Akl, "Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions," J. Parallel and Distributed Computing, vol. 24, pp. 55-71, 1995.
7. P. Fragopoulou and S.G. Akl, "Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance," IEEE Trans. Computers, vol. 45, no. 2, pp. 174-185, Feb. 1996.
8. Y. Hamada, A. Mei, F. Bao, and Y. Igarashi, "Broadcasting in Star Graphs with Byzantine Failures," Technical Report IEICE COMP96-27:47-56, July 1996.
9. S. Latifi, "On the Fault-Diameter of the Star Graph," Information Processing Letters, vol. 46, pp. 143-150, June 1993.
10. L. Gargano, U. Vaccaro, and A. Vozella, "Fault-Tolerant Routing in the Star and Pancake Interconnection Networks," Information Processing Letters, vol. 45, pp. 315-320, Apr. 1993.
11. A. Mei, F. Bao, Y. Hamada, and Y. Igarashi, "Optimal Time Broadcasting in Faulty Star Networks," Proc. WDAG '96, pp. 175-190, 1996.
12. V.E. Mendia and D. Sarkar, "Optimal Broadcasting in the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
13. A. Pelc, "Reliable Communication in Networks with Byzantine Link Failures," Networks, vol. 22, pp. 441-459, 1992.
14. Y. Rouskov and P.K. Srimani, "Fault Diameter of Star Graphs," Information Processing Letters, vol. 48, pp. 243-251, 1993.
15. J.-P. Sheu, C.-T. Liaw, and T.-S. Chen, "A Broadcasting Algorithm in Star Graph Interconnection Networks," Information Processing Letters, vol. 48, pp. 237-241, 1993.
16. J.-P. Sheu, C.-T. Liaw, and T.-S. Chen, "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, June 1995.