de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Direction-reversing Quasi-random Rumor Spreading with Restarts

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45750

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0015-3CC3-7
Zusammenfassung
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.