Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
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
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.89 |
Doerr and Fouz [Asymptotically optimal randomized rumor spreading, in: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 2011, pp. 502-513] presented a new quasi-random PUSH algorithm for the rumor spreading problem on complete graphs. Their protocol is the first randomized PUSH protocol with an asymptotically optimal running time. This is achieved by equipping all nodes with the same lists, and by allowing them to do a random restart after encountering an already informed node. Here in this work, we show that the same running time can be achieved if every second random restart is replaced by a reversion of the direction in which the nodes follow their lists. Put differently, our direction-reversing quasi-random rumor spreading protocol with random restarts achieves the same running time as the hybrid model by employing only (roughly) half the number of random choices.