Abstract
We study broadcasting in star graphs containing faulty nodes and/or edges of the Byzantine type. We propose a single-port broadcasting scheme that tolerates up to ⌊n−3d−1/2⌋ Byzantine failures in the n-star graph, where d is the smallest positive integer satisfying n≤d!. The broadcasting time of the scheme is logarithmic in the number of nodes of the n-star graph.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Akers, S. B., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In Proc. ICPP (1987) 393–400
Akers, S. B., Krishnamurthy, B.: On group graphs and their fault tolerance. IEEE Trans. Computers C-36 (1987) 885–888
Akers, S. B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Computers 38 (1989) 555–566
Bao, F., Igarashi, Y., Katano, K.: Broadcasting in hypercubes with randomly distributed Byzantine faults. IEICE Trans. Fundamentals E78-A (1995) 1239–1246
Bagherzadeh, N., Nassif, N., Latifi, S.: A routing and broadcasting scheme on faulty star graphs. IEEE Trans. Computers 42 (1993) 1398–1403
Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Trans. Parallel & Distributed Systems 5 (1994) 31–38
Fragopoulou, P., Akl, S. G.: Optimal communication algorithms on star graphs using spanning tree constructions. J. Parallel & Distributed Computing 24 (1995) 55–71
Gargano, L., Rescigno, A. A., Vaccaro, U.: Optimal communication in faulty star networks. manuscript (1995)
Mei, A., Bao, F., Hamada, Y., Igarashi, Y.: Optimal time broadcasting in faulty star networks. In Proc. WDAG (1996) to appear
Mendia, V. E., Sarkar, D.: Optimal broadcasting on the star graph. IEEE Trans. Parallel & Distributed Systems 3 (1992) 389–396
Pelc, A.: Reliable communication in networks with Byzantine link failures. Networks 22 (1992) 441–459
Rouskov, Y., Srimani, P. K.: Fault diameter of star graphs. Information Processing Letters 48 (1993) 243–251
Sheu, J.-P., Liaw, W.-H., Chen, T.-S.: A broadcasting algorithm in star graph interconnection networks. Information Processing Letters 48 (1993) 237–241
Sur, S., Srimani, P. K.: A fault tolerant routing algorithm in star graph interconnection networks. In Proc. ICPP III (1991) 267–270
Tel, G., Korach, E., Zaks, S.: Synchronizing ABD networks. IEEE/ACM Trans. Networking 2 (1994) 66–69
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamada, Y., Mei, A., Bao, F., Igarashi, Y. (1996). Broadcasting in star graphs with Byzantine failures. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027789
Download citation
DOI: https://doi.org/10.1007/BFb0027789
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62031-0
Online ISBN: 978-3-540-49626-7
eBook Packages: Springer Book Archive