Optimal time broadcasting in faulty star networks
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.
- 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.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
- 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
- 8.L. Gargano, A. A. Rescigno, and U. Vaccaro, “Optimal communication in faulty star networks.” Manuscript, 1995.Google Scholar
- 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.A. L. Liestman, “Fault-tolerant broadcast graphs.” Networks, Vol. 15, pp. 159–171, 1985.Google Scholar
- 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
- 13.A. Pelc, “Fault-tolerant broadcasting and gossiping in communication networks.” Manuscript, 1995.Google Scholar
- 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