Rumor Spreading with Bounded In-Degree

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9988)

Abstract

In the gossip-based model of communication for disseminating information in a network, in each time unit, every node u can contact a single random neighbor v but can possibly be contacted by many nodes. In the present paper, we consider a restricted model where at each node only one incoming call can be answered in one time unit. We study the implied weaker version of the well-studied pull protocol, which we call restricted pull.

We prove an exponential separation of the rumor spreading time between two variants of the protocol (the answered call among a set of calls is chosen adversarial or uniformly at random). Further, we show that if the answered call is chosen randomly, the slowdown of restricted pull versus the classic pull protocol can w.h.p. be upper bounded by \(O(\varDelta / \delta \cdot \log n)\), where \(\varDelta \) and \(\delta \) are the largest and smallest degree of the network.

Keywords

Rumor spreading Gossiping Pull Push Stochastic dominance Coupling 

References

  1. 1.
    Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded in-degree. CoRR, abs/1506.00828 (2015)Google Scholar
  2. 2.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J. Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 1–12 (1987)Google Scholar
  3. 3.
    Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Algorithms 1(4), 447–460 (1990)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Frieze, A.M., Grimmet, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57–77 (1985)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 399–408 (2010)Google Scholar
  6. 6.
    Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of the International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 57–68 (2011)Google Scholar
  7. 7.
    Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 565–574 (2000)Google Scholar
  8. 8.
    Kempe, D., Dorba, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 482–491 (2003)Google Scholar
  9. 9.
    Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Trans. Inf. Theor. 54(7), 2997–3007 (2008)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Chen, J., Pandurangan, G.: Optimal gossip-based aggregate computation. In: Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 124–133 (2010)Google Scholar
  11. 11.
    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 Symposium on Theory of Computing (STOC), pp. 961–970 (2012)Google Scholar
  12. 12.
    Censor-Hillel, K., Shachnai, H.: Fast information spreading in graphs with large weak conductance. SIAM J. Comput. 41(6), 1451–1465 (2012)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in socal networks. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 1642–1660 (2012)Google Scholar
  14. 14.
    Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 1623–1641 (2012)Google Scholar
  15. 15.
    Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 801–815 (2014)Google Scholar
  16. 16.
    Acan, H., Collevecchio, A., Mehrabian, A., Wormald, N.: On the push & pull protocol for rumour spreading. CoRR, abs/1411.0948 (2014)Google Scholar
  17. 17.
    Strassen, V.: The existence of probability measures with given marginals. Ann. Math. Stat. 36(2), 423–439 (1965)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Domb, C., Lebowitz, J.L. (eds.): Phase Transitions and Critical Phenomena, vol. 18. Academic Press, London (2001)MATHGoogle Scholar
  19. 19.
    Holley, R.: Remarks on the FKG inequalities. Commun. Math. Phys. 36(3), 227–231 (1974)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.University of FreiburgFreiburg im BreisgauGermany

Personalised recommendations