Abstract
Every node of a network has a value which should be made known to all the other nodes. Some arbitrarily placed nodes and links may be faulty, however for each pair of fault-free nodes the number of fault-free paths of length 2 that connect them is linear in the size of the network. Faults are of crash type: faulty links do not transmit and faulty nodes neither send nor receive messages. In a unit of time a node can send or receive at most one packet containing the values of at most b nodes. For every 1 ≤ b ≤ n we present an asymptotically time-optimal randomized algorithm to exchange values between all the fault-free nodes with the probability exceeding 1 - n -ε, where n is the number of nodes and ε > 0 is an arbitrary constant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. S. Chlebus, A. Gambin, P. Indyk, PRAM computations resilient to memory faults, Proceedings of the 2nd Annual European Symposium on Algorithms, LNCS 855 (1994), 401–412.
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Comput. Vol. 23, No. 4 (1994), 738–761.
K. Diks, A. Pelc, Efficient gossiping by packets in networks with random faults, SIAM J. on Discr. Math. 9 (1996), 7–18.
U. Feige, D. Peleg, P. Raghavan, E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (1990), 447–460.
P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79–133.
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.
A. Malinowski, Efficient Byzantine Agreement in networks with random faults, Parallel Proc. Letters Vol. 7, No. 1 (1997), 69–76.
A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143–156.
J. P. Schmidt, A. Siegel, A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, Proceedings of the ACM/SIAM Symposium on Discrete Algorithms (1993), 331–340.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gambin, A., Malinowski, A. (1999). Randomized Gossiping by Packets in Faulty Networks. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-47849-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66694-3
Online ISBN: 978-3-540-47849-2
eBook Packages: Springer Book Archive