de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Simple and Optimal Fault-tolerant Rumor Spreading

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Doerr,  Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons118057

Moran,  Shay
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1209.6158.pdf
(Preprint), 456KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Doerr, C., Moran, S., & Moran, S. (2013). Simple and Optimal Fault-tolerant Rumor Spreading. Retrieved from http://arxiv.org/abs/1209.6158.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-F6BC-B
Abstract
We present rumor spreading protocols for the complete graph topology that are robust against an arbitrary number of adversarial initial node failures. Our protocols are the first rumor spreading protocols combining the following three properties: they can tolerate any number of failures, they distribute the rumor to all nodes using linear number of messages (actually they use strictly minimal $n-1$ messages), and if an arbitrarily small constant fraction $p$ of nodes (including the initiator of the rumor) are working correctly, our protocols communicate the rumor to all members in the network in $O(\log(n))$ rounds. Our protocols are simpler than previous fault-tolerant rumor spreading protocols in this model, they do not require synchronization (i.e., their correctness is independent on the relative speeds of the nodes), and they do not require a simultaneous wakeup of all nodes at time 0.