DMCA
Quasirandom Rumor Spreading (2008)
Cached
Download Links
- [www.mpi-inf.mpg.de]
- [www.mpi-sb.mpg.de]
- [people.mpi-inf.mpg.de]
- [www.mpi-inf.mpg.de]
- [www.mpi-inf.mpg.de]
- [arxiv.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of SODA’08 |
| Citations: | 37 - 12 self |
BibTeX
@INPROCEEDINGS{Doerr08quasirandomrumor,
author = {Benjamin Doerr and Tobias Friedrich and Thomas Sauerwald},
title = {Quasirandom Rumor Spreading},
booktitle = {In Proc. of SODA’08},
year = {2008},
pages = {773--781}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks (“randomized rumor spreading”). In the classical model, in each round each informed node chooses a neighbor at random and informs it. Results of Frieze and Grimmett (Discrete Appl. Math. 1985) show that this simple protocol succeeds in spreading a rumor from one node of a complete graph to all others within O(log n) rounds. For the network being a hypercube or a random graph G(n, p) with p ≥ (1+ε)(log n)/n, also O(log n) rounds suffice (Feige, Peleg, Raghavan, and Upfal, Random Struct. Algorithms 1990). In the quasirandom model, we assume that each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list. Surprisingly, irrespective of the orders of the lists, the above mentioned bounds still hold. In addition, we also show a O(log n) bound for sparsely connected random graphs G(n, p) with p = (log n+f(n))/n, where f(n) → ∞ and f(n) = O(log log n). Here, the classical model needs Θ(log 2 (n)) rounds. Hence the quasirandom model achieves similar or better broadcasting times with a greatly reduced use of random bits.
