Advertisement

A fault tolerant broadcast scheme in star graphs

  • Satoshi Fujita
Session 7
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1345)

Abstract

In this paper, we propose a simple and nonadaptive fault tolerant broadcast scheme in star graphs under the single-port communication model. The proposed scheme can tolerate up to -n - 2 vertex and/or edge faults in the star graph with n! vertices, and in the fullduplex communication mode, it takes at most 4n - 3 more time units than an optimal nonadaptive broadcast scheme.

Keywords

Cayley Graph Communication Mode Star Graph Edge Fault Source Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38(4):555–566, April 1989.CrossRefGoogle Scholar
  2. 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.Google Scholar
  3. 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.CrossRefGoogle Scholar
  4. 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.CrossRefGoogle Scholar
  5. 5.
    P. Fragopoulou and S. G. Akl. Optimal communication algorithms on star graphs using spanning tree constructions. Journal of Parallel and Distributed Computing, 24:55–71,1995.CrossRefGoogle Scholar
  6. 6.
    P. Fragopoulou 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.CrossRefGoogle Scholar
  7. 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.Google Scholar
  8. 8.
    S. Latifi. On the fault-diameter of the star graph. Inform. Process. Lett., 46:143–150, June 1993.CrossRefGoogle Scholar
  9. 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.CrossRefGoogle Scholar
  10. 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.Google Scholar
  11. 11.
    V. E. Mendia and D. Sarkar. Optimal broadcasting in the star graph. IEEE Trans. Parallel and Distributed Systems, 3:389–396, July 1992.CrossRefGoogle Scholar
  12. 12.
    A. Pelc. Reliable communication in networks with Byzantine link failures. Networks, 22:441–459, 1992.Google Scholar
  13. 13.
    Y. Rouskov and P. K. Srimani. Fault diameter of star graphs. Inform. Process. Lett., 48:243–251, 1993.CrossRefGoogle Scholar
  14. 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.CrossRefMathSciNetGoogle Scholar
  15. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Satoshi Fujita
    • 1
  1. 1.Department of Electrical Engineering Faculty of EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations