A fault tolerant broadcast scheme in star graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1345, Issue , 1997, Pages 312-320

  Fujita, Satoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BROADCAST SCHEME; COMMUNICATION MODELING; EDGE FAULTS; FAULT-TOLERANT; FULL DUPLEX COMMUNICATION; STAR GRAPHS; TIME UNITS;

FAULT TOLERANCE;

EID: 77549084276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63875-X_61     Document Type: Conference Paper

References (15)

1. S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38(4):555-566, April 1989.
2. S. G. Akl and K. Qiu. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks, 23: 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, 19:95-101,1993.
4. N. Bagherzadeh, N. Nassif, and S. Latifi. A routing and broadcasting scheme on faulty star graphs. IEEE Trans. Comput., 42(11):1398-1403, November 1993.
5. P. Fragopoułou and S. G. Akl. Optimal communication algorithms on star graphs using spanning tree constructions. Journal of Parallel and Distributed Computing, 24:55-71, 1995.
6. P. Fragopoułou and S. G. Akl. Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans. Comput,, 45(2);174-185, February 1996.
7. Y. Hamada, A. Mei, F. Bao, and Y. Igarashi. Broadcasting in star graphs with byzantine failures. Technical Report of IEICE, COMP96-27:47 56, July 1996.
8. S. Latifi. On the fault-diameter of the star graph. Inform. Process. Lett., 46: 143-150, June 1993.
9. L.Gargano, U. Vaccaro, and A. Vozella. Fault tolerant routing in the star and pancake interconnection networks. Inform. Process. Lett., 45:315-320, April 1993.
10. A. Mei, F. Bao, Y. Hamada, and Y. Igarashi. Optimal time broadcasting in faulty star networks. In Proc. WDAG'96, LNCS 1151, pp.175-190, 1996.
11. V. E. Mendia and D. Sarkar. Optimal broadcasting in the star graph. IEEE Trans. Parallel and Distributed Systems, 3:389-396, July 1992.
12. A. Pelc. Reliable communication in networks with Byzantine link failures. Networks, 22:441-459, 1992.
13. Y. Rouskov and P. K. Srimani. Fault diameter of star graphs. Inform. Process. Lett., 48:243-251,1993.
14. J.-P. Sheu, C.-T. Liaw, and T.-S. Chen. A broadcasting algorithm in star graph interconnection networks. Inform. Process. Lett., 48:237-241, 1993.
15. 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, 6(6), June 1995.