Skip to main content
SpringerLink
Log in

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

  • Conference paper
Automata, Languages and Programming (ICALP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6199))

Included in the following conference series:

Abstract

Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the ability to tolerate oblivious failures.

For adaptive failures, we present a new gossip protocol, TrickleGossip, which achieves near-optimal O(n log3 n) message complexity. To the best of our knowledge, this is the first epidemic-style protocol that can tolerate adaptive failures. We also show a direct relation between resilience and message complexity, demonstrating that gossip protocols which tolerate a large number of adaptive failures need to use a super-linear number of messages with high probability.

For oblivious failures, we present a new gossip protocol, CoordinatedGossip, that achieves optimal O(n) message complexity. This protocol makes novel use of the universe reduction technique to limit the message complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: FOCS (2000)

    Google Scholar 

  2. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC (1987)

    Google Scholar 

  3. Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. on Comp. Sys. 17, 41–86 (1999)

    Article  Google Scholar 

  4. Eugster, P., Guerraoui, R., Handurukande, S., Kermarrec, A.-M., Kouznetsov, P.: Lightweight probabilistic broadcast. ACM Trans. on Comp. Sys. 21(4) (2003)

    Google Scholar 

  5. Kermarrec, A., Massoulie, L., Ganesh, A.: Probabilistic reliable multicast in ad hoc networks. IEEE Trans. on Parallel and Distr. Syst. 14 (2003)

    Google Scholar 

  6. Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. Journal of ACM, 943–967 (2004)

    Google Scholar 

  7. Chaintreau, A., Le Boudec, J.-Y., Ristanovic, N.: The age of gossip: spatial mean field regime. In: SIGMETRICS (2009)

    Google Scholar 

  8. Chlebus, B.S., Kowalski, D.R.: Robust gossiping with an application to consensus. J. Comput. Syst. Sci. 72(8), 1262–1281 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chlebus, B.S., Kowalski, D.R.: Time and communication efficient consensus for crash failures (2006)

    Google Scholar 

  10. Frieze, A.M., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics (10), 55–77 (1985)

    Google Scholar 

  11. Pittel, B.: On spreading a rumor. SIAM J. Appl. Math. 47(1), 213–223 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  12. Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 128–137. Springer, Heidelberg (1990)

    Google Scholar 

  13. Elsässer, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: SPAA (2006)

    Google Scholar 

  14. Berenbrink, P., Elsaesser, R., Friedetzky, T.: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: PODC (2008)

    Google Scholar 

  15. Elsässer, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: SODA (2008)

    Google Scholar 

  16. Elsässer, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci. 410(36), 3414–3427 (2009)

    Article  MATH  Google Scholar 

  17. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: SODA (2008)

    Google Scholar 

  18. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 366–377. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Doerr, B., Huber, A., Levavi, A.: Strong robustness of randomized rumor spreading protocols. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Czumaj, A., Gasieniec, L., Pelc, A.: Time and cost trade-offs in gossiping. SIAM Journal on Discrete Mathematics 11, 400–413 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. Georgiou, C., Gilbert, S., Guerraoui, R., Kowalski, D.R.: On the complexity of asynchronous gossip. In: PODC (2008)

    Google Scholar 

  22. Hromkovic, J., Klasing, R., Pelc, A., Ruzika, P., Unger, W.: Dissemination of information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  23. Ben-Or, M., Pavlov, E., Vaikuntanathan, V.: Byzantine agreement in the full-information model in O(log n) rounds. In: STOC (2006)

    Google Scholar 

  24. Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous byzantine agreement and leader election with full information. In: SODA, pp. 1038–1047 (2008)

    Google Scholar 

  25. King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA, pp. 990–999 (2006)

    Google Scholar 

  26. King, V., Saia, J.: Fast, scalable byzantine agreement in the full information model with a nonadaptive adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  27. Gilbert, S., Kowalski, D.: Distributed agreement with optimal communication complexity. In: SODA (2010)

    Google Scholar 

  28. Alistarh, D., Gilbert, S., Guerraoui, R., Zadimoghaddam, M.: How efficient can gossip be? (technical report), https://infoscience.epfl.ch/record/148544

  29. Dubhashi, D., Ranjan, D.: Balls and bins: A study in negative dependence. Random Structures and Algorithms 13, 99–124 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    Dan Alistarh, Seth Gilbert, Rachid Guerraoui & Morteza Zadimoghaddam

  2. Massachusetts Institute of Technology, Cambridge, USA

    Morteza Zadimoghaddam

Authors
  1. Dan Alistarh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seth Gilbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Morteza Zadimoghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Samson Abramsky

  2. Université de Bordeaux (LaBRI) & INRIA, 351, cours de la Libération, 33405, Talence Cedex, France,

    Cyril Gavoille

  3. INRIA, Centre de Recherche Bordeaux – Sud-Ouest, 351 cours de la Libération, 33405, Talence Cedex, France

    Claude Kirchner

  4. Heinz Nixdorf Institute, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Friedhelm Meyer auf der Heide

  5. University of Patras and RACTI, 26500, Patras, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alistarh, D., Gilbert, S., Guerraoui, R., Zadimoghaddam, M. (2010). How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14162-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14161-4

  • Online ISBN: 978-3-642-14162-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation