Distributed Computing

, Volume 29, Issue 2, pp 89–104 | Cite as

Simple and optimal randomized fault-tolerant rumor spreading

  • Benjamin Doerr
  • Carola Doerr
  • Shay Moran
  • Shlomo Moran
Article

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(\log n)\) 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).

Keywords

Rumor spreading Randomized algorithms Robustness  Distributed computing 

Notes

Acknowledgments

The authors are happy to have received very helpful comments from anonymous reviewers, in particular the suggestion to use \(k\)-wise \(\delta \)-dependent distributions for the result presented in Sect. 6. We would also like to thank Ariel Gabizon for very interesting discussions and for suggesting the use of adaptive distinguishers. Part of this work have been done while Benjamin Doerr was with the Max Planck Institute for Informatics (MPII) in Saarbrücken, Germany, Carola Doerr was with the MPII and the LIAFA, Université Paris Diderot (Paris 7), France, and Shlomo Moran was a visitor at the MPII. Carola Doerr gratefully acknowledges support from a Feodor Lynen postdoctoral research fellowship of the Alexander von Humboldt Foundation and from the Agence Nationale de la Recherche under the Project ANR-09-JCJC-0067-01. Shlomo Moran is supported by the Bernard Elkin Chair in Computer Science.

References

  1. 1.
    Billingsley, P.: Probability and Measure. Wiley, New York (1995)Google Scholar
  2. 2.
    Censor-Hillel, K., Haeupler, B., Kelner, J.A., Maymounkov, P.: Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 961–970. ACM (2012)Google Scholar
  3. 3.
    Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic algorithms for replicated database maintenance. Oper. Syst. Rev. 22, 8–32 (1988)CrossRefGoogle Scholar
  4. 4.
    Diks, K., Pelc, A.: Optimal adaptive broadcasting with a bounded fraction of faulty nodes. Algorithmica 28, 37–50 (2000)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Doerr, B.: Analyzing randomized search heuristics: tools from probability theory. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 1–20. World Scientific Publishing, Singapore (2011)CrossRefGoogle Scholar
  6. 6.
    Doerr, B., Fouz, M.: Quasi-random rumor spreading: reducing randomness can be costly. Inf. Process. Lett. 111, 227–230 (2011)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomised Algorithms. Cambridge University Press, Cambridge (2009)CrossRefMATHGoogle Scholar
  8. 8.
    Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10, 57–77 (1985)Google Scholar
  9. 9.
    Gasieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Comput 22, 903–912 (1996). Preliminary version available from http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.3838
  10. 10.
    Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations. Algorithmica 55, 113–133 (2009)Google Scholar
  11. 11.
    Karp, R.M., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 565–574. IEEE (2000)Google Scholar
  12. 12.
    Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261–277 (1988)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)MATHGoogle Scholar
  14. 14.
    Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)CrossRefMATHGoogle Scholar
  15. 15.
    Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Trans. Inf. Theory 54, 2997–3007 (2008)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Lubyrackoff revisited. J. Cryptol. 12, 29–66 (1999)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Pittel, B.: On spreading a rumor. SIAM J. Appl. Math. 47, 213–223 (1987)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Raab, M., Steger, A.: “Balls into bins”—a simple and tight analysis. In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pp. 159–170. Springer (1998)Google Scholar
  19. 19.
    Taubenfeld, G., Katz, S., Moran, S.: Initial failures in distributed computations. Int. J. Parallel Program. 18, 255–276 (1989)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Upfal, E.: Tolerating a linear number of faults in networks of bounded degree. Inf. Comput. 115, 312–320 (1994)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Yao, A.C.C.: Probabilistic computations: Toward a unified measure of complexity (extended abstract). In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227. IEEE (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Benjamin Doerr
    • 1
  • Carola Doerr
    • 2
    • 3
  • Shay Moran
    • 4
    • 5
  • Shlomo Moran
    • 4
  1. 1.LIXÉcole PolytechniquePalaiseauFrance
  2. 2.Sorbonne UniversitésUPMC Univ Paris 06, UMR 7606, LIP6ParisFrance
  3. 3.CNRSUMR 7606, LIP6ParisFrance
  4. 4.Computer Science DepartmentTechnion - Israel Institute of TechnologyHaifaIsrael
  5. 5.Max Planck Institute for InformaticsSaarbrückenGermany

Personalised recommendations