Advertisement

How to Discreetly Spread a Rumor in a Crowd

  • Mohsen Ghaffari
  • Calvin NewportEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9888)

Abstract

In this paper, we study PUSH-PULL style rumor spreading algorithms in the mobile telephone model, a variant of the classical telephone model in which each node can participate in at most one connection per round; i.e., you can no longer have multiple nodes pull information from the same source in a single round. Our model also includes two new parameterized generalizations: (1) the network topology can undergo a bounded rate of change (for a parameterized rate that spans from no changes to changes in every round); and (2) in each round, each node can advertise a bounded amount of information to all of its neighbors before connection decisions are made (for a parameterized number of bits that spans from no advertisement to large advertisements). We prove that in the mobile telephone model with no advertisements and no topology changes, PUSH-PULL style algorithms perform poorly with respect to a graph’s vertex expansion and graph conductance as compared to the known tight results in the classical telephone model. We then prove, however, that if nodes are allowed to advertise a single bit in each round, a natural variation of PUSH-PULL terminates in time that matches (within logarithmic factors) this strategy’s performance in the classical telephone model—even in the presence of frequent topology changes. We also analyze how the performance of this algorithm degrades as the rate of change increases toward the maximum possible amount. We argue that our model matches well the properties of emerging peer-to-peer communication standards for mobile devices, and that our efficient PUSH-PULL variation that leverages small advertisements and adapts well to topology changes is a good choice for rumor spreading in this increasingly important setting.

References

  1. 1.
    Baumann, H., Fraigniaud, P., Harutyunyan, H.A., De Verclos, R.: The worst case behavior of randomized gossip protocols. Theoret. Comput. Sci. 560, 108–120 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2010)Google Scholar
  3. 3.
    Clarkson, T., Gorse, D., Taylor, J., Ng, C.: Epidemic algorithms for replicated database management. IEEE Trans. Comput. 1, 52–61 (1992)Google Scholar
  4. 4.
    Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded in-degree. arXiv preprint arXiv:1506.00828 (2015)
  5. 5.
    Fountoulakis, N., Panagiotou, K.: Rumor spreading on random regular graphs and expanders. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol. 6302, pp. 560–573. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57–77 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ghaffari, M., Newport, C.: How to discreetly spread a rumor in a crowd. http://people.cs.georgetown.edu/~cnewport/pubs/gn-disc2016.pdf. Also available on arXiv
  8. 8.
    Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS) (2011)Google Scholar
  9. 9.
    Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2014)Google Scholar
  10. 10.
    Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of the ACM-SIAM symposium on Discrete Algorithms (SODA), pp. 1623–1641. SIAM (2012)Google Scholar
  11. 11.
    Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp. 565–574 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.MIT CSAILCambridgeUSA
  2. 2.Georgetown UniversityWashington, D.C.USA

Personalised recommendations