Optimal time broadcasting in faulty star networks

  • Aohan Mei
  • Feng Bao
  • Yukihiro Hamada
  • Yoshihide Igarashi
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1151)


This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n — 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called diffusing- and -disseminating, is introduced to design our broadcasting scheme. This technique is useful to improve the efficiency of broadcasting in star networks. We analyze the reliability of the broadcasting scheme in the case where faults are randomly distributed in the n-star network. The broadcasting scheme in the n-star network can tolerate (n!)* random faults with a high probability, where α is any constant less than 1.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. B. Akers, D. Harel, and B. Krishnamurthy, “The star graph: An attractive alternative to the n-cube.” In Proc. Int. Conf. Parallel Processing, pp. 393–400, 1987.Google Scholar
  2. 2.
    S. B. Akers and B. Krishnamurthy, “On group graphs and their fault tolerance.” IEEE Trans. Computers, Vol. C-36, pp. 885–888, 1987.Google Scholar
  3. 3.
    S. B. Akers and B. Krishnamurthy, “A group-theoretic model for symmetric interconnection networks.” IEEE Trans. Computers, Vol. 38, pp. 555–566, 1989.CrossRefGoogle Scholar
  4. 4.
    N. Bagherzadeh, N. Nassif, and S. Latifi, “dA routing and broadcasting scheme on faulty star graphs.” IEEE Trans. Computers, Vol. 42, pp. 1398–1403, 1993.CrossRefGoogle Scholar
  5. 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.Google Scholar
  6. 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.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. 8.
    L. Gargano, A. A. Rescigno, and U. Vaccaro, “Optimal communication in faulty star networks.” Manuscript, 1995.Google Scholar
  9. 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.Google Scholar
  10. 10.
    A. L. Liestman, “Fault-tolerant broadcast graphs.” Networks, Vol. 15, pp. 159–171, 1985.Google Scholar
  11. 11.
    A. Mei, Y. Igarashi, and N. Shimizu, “Efficient broadcasting on faulty star networks.” In Proc. 4th International School and Symposium: Formal Techniques in Real-Time and Fault-Tolerant Systems, Uppsala, Sweden, 1996, to appear.Google Scholar
  12. 12.
    V. E. Mendia and D. Sarkar, “Optimal broadcasting on the star graph.” IEEE Trans. Parallel and Distributed Systems, Vol. 3, pp. 389–396, 1992.CrossRefGoogle Scholar
  13. 13.
    A. Pelc, “Fault-tolerant broadcasting and gossiping in communication networks.” Manuscript, 1995.Google Scholar
  14. 14.
    D. Peleg, “A note on optimal time broadcast in faulty hypercubes.” Journal of Parallel and Distributed Computing, Vol. 26, pp. 132–135, 1995.CrossRefGoogle Scholar
  15. 15.
    P. Ramanathan and K. G. Shin, “Reliable broadcast in hypercube multicomputers.” IEEE Trans. Computers, Vol. 37, pp. 1654–1657, 1988.CrossRefGoogle Scholar
  16. 16.
    Y. Rouskov and P. K. Srimani, “Fault diameter of star graphs.” Information Processing Letters, Vol. 48, pp. 243–251, 1993.CrossRefGoogle Scholar
  17. 17.
    S. Sur and P. K. Srimani, “A fault tolerant routing algorithm in star graph interconnection networks.” In Proc. Int. Conf. Parallel Processing, Vol. III, pp. 267–270, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Aohan Mei
    • 1
  • Feng Bao
    • 1
  • Yukihiro Hamada
    • 1
  • Yoshihide Igarashi
    • 1
  1. 1.Department of Computer ScienceGunma UniversityKiryuJapan

Personalised recommendations