Direction-reversing Quasi-random Rumor Spreading with Restarts

Winzen, C.

doi:10.1016/j.ipl.2013.09.006

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsStatisticsRelease HistoryDetailsSummary

Released

Journal Article

Direction-reversing Quasi-random Rumor Spreading with Restarts

MPS-Authors

/persons/resource/persons45750

Winzen, C.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource

No external resources are shared

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Winzen, C. (2013). Direction-reversing Quasi-random Rumor Spreading with Restarts. Information Processing Letters, 113(22-24), 921-926. doi:10.1016/j.ipl.2013.09.006.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-3CC3-7

Abstract

Doerr and Fouz [\emphAsymptotically Optimal Randomized Rumor Spreading}, ICALP 2011] 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 \emph{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.