Abstract
In linear broadcasting, packets originally stored in one node, called the source, have to visit all other nodes of the network. Every packet has a predetermined route indicating in which order it visits the nodes. A faulty link or node of the network destroys all packets passing through it. A linear broadcasting scheme consisting of packets' routes is f-fault-tolerant if every fault-free node is visited by at least one packet for any configuration of at most f link or node failures. We estimate the minimum number of packets for which there exists an f-fault-tolerant linear broadcasting scheme in complete networks, and we construct schemes using few packets. Variations of this problem when faults can occur only in links or only in nodes are also considered.
Research partly supported by grant from KBN. This work was done during the author's stay at the Université du Québec à Hull, supported by NSERC International Fellowship.
Research supported in part by NSERC grant OGP 0008136.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K.A. Berman & M. Hawrylycz, Telephone problems with failures, SIAM J. Alg. Disc. Meth. 7 (1986), 13–17.
D. Bienstock, Broadcasting with random faults, Disc. Appl. Math. 20 (1988), 1–7.
S. Bitan & S. Zaks, Optimal linear broadcast, J. of Algorithms 14 (1993), 288–315.
B.S. Chlebus, K. Diks & A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proc. ICALP'93, LNCS 700, 388–397.
B.S. Chlebus, K. Diks & A. Pelc, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS'21 (1991), 266–273.
C.T. Chou & I.S. Gopal, Linear broadcast routing, J. of Algorithms 10 (1989), 490–517.
I. Cidon & I.S. Gopal, PARIS: An approach to private integrated networks, Intern. J. Analog Digital Cable Systems 1 (1988), 77–85.
T. Cormen, C. Leisserson, & R.L. Rivest, Introduction to algorithms, The MIT Press, 1990.
P. Erdös & Szekers, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463–470.
L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992), 469–486.
D. Greenberg, Report dispersal, in: Open problems for the International Workshop on Networks and Information Dissemination, Bowen Island, B.C. (1992).
R.W. Haddad, S. Roy & A.A. Schafer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth. 8 (1987), 439–445.
S.M. Hedetniemi, S.T. Hedetniemi & A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319–349.
A. Segal, Distributed network protocols, IEEE Trans. Inf. Theory IT-29 (1983), 23–35.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diks, K., Pelc, A. (1994). Fault-tolerant linear broadcasting. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive