Efficient broadcasting on faulty star networks

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

Volumn 1135, Issue , 1996, Pages 298-305

  Mei, Aohan ^a   Igarashi, Yoshihide ^a   Shimizu, Naoki ^b  

^a GUNMA UNIVERSITY   (Japan)

^b Oki Data Systems   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; FAULT TOLERANCE;

BROADCASTING SCHEMES; STAR GRAPHS; STAR NETWORK;

REAL TIME SYSTEMS;

EID: 33746411036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61648-9_47     Document Type: Conference Paper

References (16)

1. S. B. Akers, D. Harel, and B. Krlshnamurthy, "The star graph: An attractive alternative to the n-cube." In Proc. Int. Conf. Parallel Processing, pp. 393-400, 1987.
2. S. B. Akers and B. Krishnamurthy, "On group graphs and their fault tolerance." IEEE Trans. Computers, Vol. C-36, pp. 885-888, 1987.
3. S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks." IEEE Trans. Computers, Vol. 38, pp. 555-566, 1989.
4. N. Bagherzadeh, N. Nassif, and S. Latifi, "A routing and broadcasting scheme on faulty star graphs." IEEE Trans. Computers, Vol. 42, pp. 1398-1403, 1993.
5. S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura, and O. Petersson, "Information disseminating schemes for fault tolerance in hypercubes." IEICE Trans. Fundamentals, Vol. E75-A, pp. 255-260, 1992.
6. K. Day and A. Tripathi, "A comparative study of topological properties of hypercubes and star graphs." IEEE Trans. Parallel and Distributed Systems, Vol. 5, pp. 31-38, 1994.
7. P. Fragopoulou and S. G. Akl, "Optimal communication algorithms on star graphs using spanning tree constructions." Journal of Parallel and Distributed Computing, Vol. 24, pp. 55-71, 1995.
8. L. Gargano, A. A. Rescigno, and U. Vaccaro, "Optimal communication in faulty star networks." Manuscript, 1995.
9. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, "A survey of gossiping and broadcasting in communication networks." Networks, Vol. 18, pp. 319-349, 1988.
10. A. Mei, F. Bao, Y. Hamada, and Y. Igarashi, "Optimal time broadcasting in faulty star networks." In Proc. 10th International Workshop on Distributed Algorithms, 1996, to appear.
11. V. E. Mendia and D. Sarkax, "Optimal broadcasting on the star graph." IEEE Trans. Parallel and Distributed Systems, Vol. 3, pp. 389-396, 1992.
12. A. Pelc, "Fault-tolerant broadcasting and gossiping in communication networks." Manuscript, 1995.
13. D. Peleg, "A note on optimal time broadcast in faulty hypercubes." Journal of Parallel and Distributed Computing, Vol. 26, pp. 132-135, 1995.
14. P. Ramanathan and K. G. Shin, "Reliable broadcast in hypercube multicomputers." IEEE Trans. Computers, Vol. 37, pp. 1654-1657, 1988.
15. Y. Rouskov and P. K. Srimani, "Fault diameter of star graphs." Information Processing Letters, Vol. 48, pp. 243-251, 1993.
16. S. Sur and P. K. Srimani, "A fault tolerant routing algorithm in star graph interconnection networks." In Proe. Int. Conf. Parallel Processing, Vol. III, pp. 267-270, 1991.