Abstract
Broadcasting concerns transmitting information from a node of a communication network to all other nodes. We consider this problem assuming that links and nodes of the network fail independently with given probabilities p<1 and q<1, respectively. For a positive constant ε, broadcasting in an n-node network is said to be ε-safe, if source information is transmitted to all fault-free nodes with probability at least 1−n-ɛ. For any p<1, q<1 and ε>0 we show a class of n-node networks with maximum degree O(log n) and ε-safe broadcasting algorithms for such networks working in logarithmic time.
partly supported by EC Cooperative Action IC-1000 (project ALTEC: Algorithms for Future Technologies).
partly supported by NSERC International Fellowship.
partly supported 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
D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979), 155–193.
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.
B.S. Chlebus, K. Diks, A. Pelc, Optimal broadcasting in faulty hypercubes, Proc. 21st Int. Symp. on Fault-Tolerant Computing, Montreal, Canada (1991), 266–273.
K. Diks, A. Pelc, Reliable gossip schemes with random link failures, Proc. 28th Ann. Allerton Conf. on Comm. Control and Comp. (1990), 978–987.
K. Diks, A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math. 5 (1992), 338–344.
L. Gargano, Tighter time bounds on fault tolerant broadcasting and gossiping, Networks, to appear.
R.W. Haddad, S. Roy, A.A. Schaffer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth. 8 (1987), 439–445.
T. Hagerup, C. Rub, A guided tour of Chernoff bounds, Inf. Proc. Letters 33 (1989/90), 305–308.
S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319–349.
D.W. Krumme, K.N. Venkataraman, G. Cybenko, Gossiping in minimal time, SIAM J. on Computing 21 (1992), 111–139.
E.R. Scheinerman, J.C. Wierman, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math. 25 (1989), 289–297.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S., Diks, K., Pelc, A. (1993). Sparse networks supporting efficient reliable broadcasting. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_88
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive