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: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.
Original language | English |
---|---|
Pages (from-to) | 447-460 |
Number of pages | 14 |
Journal | Random Structures and Algorithms |
Volume | 1 |
Issue number | 4 |
DOIs | |
State | Published - 1990 |
Externally published | Yes |
Keywords
- distributed computation
- random graphs
- randomized algorithms
- rumor propagation