Randomized broadcast in networks
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.
KeywordsUndirected Graph Link Failure Cover Time Broadcast Algorithm Bounded Degree Graph
Unable to display preview. Download preview PDF.
- [AKL+79]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.Google Scholar
- [BK88]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.Google Scholar
- [Che52]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.Google Scholar
- [CRR+89]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.Google Scholar
- [DGH+87]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.Google Scholar
- [HHL88]S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.Google Scholar
- [LR53]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.Google Scholar