Simple and optimal randomized fault-tolerant rumor spreading

Abstract : We revisit the classic problem of spreading a piece of information in a group of n fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasieniec and Pelc (Parallel Comput 22:903–912, 1996), we derive for the first time protocols that (i) use a linear number of messages, (ii) are correct even when an arbitrary number of adversarially chosen processors does not participate in the process, and (iii) with high probability have the asymptotically optimal runtime of O(logn) when at least an arbitrarily small constant fraction of the processors are working. In addition, our protocols do not require that the system is synchronized nor that all processors are simultaneously woken up at time zero, they are fully based on push-operations, and they do not need an a priori estimate on the number of failed nodes. Our protocols thus overcome the typical disadvantages of the two known approaches, algorithms based on random gossip (typically needing a large number of messages due to their unorganized nature) and algorithms based on fair workload splitting (which are either not time-efficient or require intricate preprocessing steps plus synchronization).
Document type :
Journal articles
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01327397
Contributor : Gestionnaire Hal-Upmc <>
Submitted on : Monday, June 6, 2016 - 4:46:05 PM
Last modification on : Thursday, March 28, 2019 - 4:16:11 AM

Links full text

Identifiers

Citation

Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran. Simple and optimal randomized fault-tolerant rumor spreading. Distributed Computing, Springer Verlag, 2016, 29 (2), pp.89-104. ⟨10.1007/s00446-014-0238-z⟩. ⟨hal-01327397⟩

Share

Metrics

Record views

333