论文信息 - Randomized Broadcast in Networks

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.

[1] WILLIAM GOFFMAN,et al. Generalization of Epidemic Theory: An Application to the Transmission of Ideas , 1964, Nature.

[2] Prabhakar Raghavan,et al. The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[3] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[4] Andrei Z. Broder,et al. Bounds on the cover time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[6] B. Pittel. On spreading a rumor , 1987 .

[7] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[8] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[10] A. Rapoport,et al. Contribution to the mathematical theory of contagion and spread of information: I. Spread through a thoroughly mixed population , 1953 .