skip to main content
research-article

Simple, Fast and Deterministic Gossip and Rumor Spreading

Published:10 December 2015Publication History
Skip Abstract Section

Abstract

We study gossip algorithms for the rumor spreading problem, which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call one neighbor per round and have recently attracted attention as message efficient, simple, and robust solutions to the rumor spreading problem.

A long series of papers analyzed the performance of uniform random gossip in which nodes repeatedly call a random neighbor to exchange all rumors with. A main result of this investigation was that uniform gossip completes in O(log n/Φ) rounds where Φ is the conductance of the network. Nonuniform random gossip schemes were devised to allow efficient rumor spreading in networks with bottlenecks. In particular, [Censor-Hillel et al., STOC&12] gave an O(log3 n) algorithm to solve the 1-local broadcast problem in which each node wants to exchange rumors locally with its 1-neighborhood. By repeatedly applying this protocol, one can solve the global rumor spreading quickly for all networks with small diameter, independently of the conductance.

All these algorithms are inherently randomized in their design and analysis. A parallel research direction has been to reduce and determine the amount of randomness needed for efficient rumor spreading. This has been done via lower bounds for restricted models and by designing gossip algorithms with a reduced need for randomness, for instance, by using pseudorandom generators with short random seeds. The general intuition and consensus of these results has been that randomization plays a important role in effectively spreading rumors and that at least a polylogarithmic number of random bit are crucially needed.

In this article improves over the state of the art in several ways by presenting a deterministic gossip algorithm that solves the the k-local broadcast problem in 2(k + log2 n) log2 n rounds. Besides being the first efficient deterministic solution to the rumor spreading problem this algorithm is interesting in many aspects: It is simpler, more natural, more robust, and faster than its randomized pendant and guarantees success with certainty instead of with high probability. Its analysis is furthermore simple, self-contained, and fundamentally different from prior works.

References

  1. S. Angelopoulos, B. Doerr, A. Huber, and K. Panagiotou. 2009. Tight bounds for quasirandom rumor spreading. Electronic J. Combinatorics 16, 1, R102.Google ScholarGoogle ScholarCross RefCross Ref
  2. K. Censor-Hillel and G. Giakkoupis. 2012. Fast and Robust Information Spreading. Unpublished manuscript.Google ScholarGoogle Scholar
  3. Keren Censor-Hillel, Bernhard Haeupler, Petar Maymounkov, and Jonathan Kelner. 2012. 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. 961--970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Keren Censor-Hillel and Hadas Shachnai. 2011. Fast information spreading in graphs with large weak conductance. In Proceedings of the ACM--SIAM Symposium on Discrete Algorithms. 440--448. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Flavio Chierichetti, Silvio Lattanzi, and Alessandro Panconesi. 2010a. Almost tight bounds for rumour spreading with conductance. In Proceedings of the ACM Symposium on Theory of Computing. 399--408. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Chierichetti, S. Lattanzi, and A. Panconesi. 2010b. Rumour spreading and graph conductance. In Proceedings of the ACM Symposium on Discrete Algorithms. 1657--1663. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B. Doerr and M. Fouz. 2009. A time-randomness tradeoff for quasi-random rumour spreading. Electronic Notes in Discrete Mathematics 34, 335--339.Google ScholarGoogle ScholarCross RefCross Ref
  8. Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald. 2008. Quasirandom rumor spreading. In Proceedings of the ACM--SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 773--781. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Benjamin Doerr, Tobias Friedrich, and Thomas Sauerwald. 2009. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In Proceedings of the International Colloquium on Automata, Languages and Programming. 366--377. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nikolaos Fountoulakis and Anna Huber. 2009. Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading. SIAM J. Discrete Mathematics 23, 4, 1964--1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. M. Frieze and G. R. Grimmett. 1985. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10, 1, 57--77.Google ScholarGoogle ScholarCross RefCross Ref
  12. George Giakkoupis. 2011. Tight bounds for rumor spreading in graphs of a given conductance. In Proceedings of the Symposium on Theoretical Aspects of Computer Science. 57--68.Google ScholarGoogle Scholar
  13. G. Giakkoupis. 2014. Tight bounds for rumor spreading with vertex expansion. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 801--815. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. George Giakkoupis and Thomas Sauerwald. 2012. Rumor spreading and vertex expansion. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 1623--1641. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. Giakkoupis, T. Sauerwald, H. Sun, and P. Woelfel. 2012. Low randomness rumor spreading via hashing. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, Vol. 14. 314--325.Google ScholarGoogle Scholar
  16. George Giakkoupis and Philipp Woelfel. 2011. On the randomness requirements of rumor spreading. In Proceedings of the 22nd ACM--SIAM Symposium on Discrete Algorithms. 449--461. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Bernhard Haeupler. 2011. Analyzing network coding gossip made easy. In Proceedings of the ACM Symposium on Theory of Computing. 293--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Bernhard Haeupler. 2013. Simple, fast and deterministic gossip and rumor spreading. In Proceedings of the ACM--SIAM Symposium on Discrete Algorithms. 705--716. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Bernhard Haeupler and Dahlia Malkhi. 2014. Optimal gossip with direct addressing. 176--185. DOI:http://dx.doi.org/10.1145/2611462.2611489 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Bernhard Haeupler and Dahlia Malkhi. 2015. Distributed resource discovery in sub-logarithmic time. In Proceedings of the ACM Symposium on Principles of Distributed Computing. 413--419. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Mor Harchol-Balter, Tom Leighton, and Daniel Lewin. 1999. Resource discovery in distributed networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing. 229--237. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. 2000. Randomized rumor spreading. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 565--574. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Shay Kutten, David Peleg, and Uzi Vishkin. 2003. Deterministic resource discovery in distributed networks. Theory of Computing Systems 36, 5, 479--495.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Seth Pettie. 2009. Low distortion spanners. ACM Trans. Algorithms 6, 1, Article 7, 22 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Pettie. 2010. Distributed algorithms for ultrasparse spanners and linear size skeletons. Distributed Computing 22, 3, 147--166.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Boris Pittel. 1987. On spreading a rumor. SIAM J. Appl. Math. 47, 1, 213--223. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Simple, Fast and Deterministic Gossip and Rumor Spreading

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!