Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
The Cover Time of Random Regular Graphs
SIAM Journal on Discrete Mathematics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading
SIAM Journal on Discrete Mathematics
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
| Hi-index | 0.00 |
We empirically analyze two versions of the well-known “randomized rumor spreading” protocol to disseminate a piece of information in networks. In the classical model, in each round, each informed node informs a random neighbor. In the recently proposed quasirandom variant, 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. While for sparse random graphs a better performance of the quasirandom model could be proven, all other results show that, independent of the structure of the lists, the same asymptotic performance guarantees hold as for the classical model. In this work, we compare the two models experimentally. Not only does this show that the quasirandom model generally is faster, but it also shows that the runtime is more concentrated around the mean. This is surprising given that much fewer random bits are used in the quasirandom process. These advantages are also observed in a lossy communication model, where each transmission does not reach its target with a certain probability, and in an asynchronous model, where nodes send at random times drawn from an exponential distribution. We also show that typically the particular structure of the lists has little influence on the efficiency.