Abstract
In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: (1) in simple, robust and efficient broadcast protocols; (2) in the maintenance of replicated databases.
Supported in part by an Allon Fellowship.
A portion of this work was done while the author was visiting the Weizmann Institute of Science, Rehovot, Israel.
Work at the Weizmann Institute supported in part by a Bat-Sheva de Rothschild Award and by a Revson Career Development Award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science, pages 218–223, San Juan, Puerto Rico, October 1979.
A.Z. Broder and A.R. Karlin. Bounds on covering times. In 29th Annual Symposium on Foundations of Computer Science, pages 479–487, White Plains, NY, October 1988.
H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat., 23:493–509, 1952.
A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 574–586, Seattle, May 1989.
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database management. In 6th ACM Symp. on Principles of Distributed Computing, pages 1–12, 1987.
A.M. Frieze and G.R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Math., 10:57–77, 1985.
W. Goffman and V.A. Newill. Generalization of epidemic theory — an application to the transmission of ideas. Nature, 204:225–228, 1964.
S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.
H.G. Landau and A. Rapoport. Contribution to the mathematical theory of contagion and spread of information: I. spread through a thoroughly mixed population. Bull. Math. Biophys., 15:173–183, 1953.
B.M. Pittel. On spreading a rumour. SIAM J. Applied Math., 47:213–223, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feige, U., Peleg, D., Raghavan, P., Upfal, E. (1990). Randomized broadcast in networks. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_62
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive