Skip to main content
SpringerLink
Log in

Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes

  • Conference paper
  • First Online:
Computer Performance Engineering and Stochastic Modelling (EPEW 2023, ASMTA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14231))

  • 168 Accesses

Abstract

The recent rise of interest in distributed applications has highlighted the importance of effective information dissemination. The challenge lies in the fact that nodes in a distributed system are not necessarily synchronized, and may fail at any time. This has led to the emergence of randomized rumor spreading protocols, such as push and pull protocols, which have been studied extensively. The k-pull operation, which allows an uninformed node to ask for the rumor from a fixed number of other nodes in parallel, has been proposed to improve the pull algorithm’s effectiveness. This paper presents and studies the performance of the k-pull operation in the presence of a certain fraction f of non-cooperative nodes. Our goal is to understand the impact of k on the propagation of the rumor despite the presence of a fraction f of non-collaborative nodes.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.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

Similar content being viewed by others

References

  1. Acan, H., Collevecchio, A., Mehrabian, A., Wormald, N.: On the push & pull protocol for rumour spreading. Trends Math. 6, 3–10 (2017)

    Article  MATH  Google Scholar 

  2. Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theor. Comput. Sci. 412(24), 2602–2610 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Clementi, A., Crescenzi, P., Doerr, C., Fraigniaud, P., Pasquale, F., Silvestri, R.: Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2), 290–312 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded indegree. In: Proceedings of the International Colloquium on Structural Information and Communication Complexity (SIROCCO) (2016)

    Google Scholar 

  5. Demers, A.J., et al.: Epidemic algorithms for replicated database maintenance. PODC 87, 1–12 (1987)

    Google Scholar 

  6. Doerr, B., Fouz, M., Friedrich, T.: Experimental analysis of rumor spreading in social networks. MedAlg 2012, 159–173 (2012)

    MathSciNet  MATH  Google Scholar 

  7. Doerr, B., Kostrygin, A.: Randomized rumor spreading revisited. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.), ICALP 2017, vol. 80, pp. 138:1–138:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  8. Feige, F., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Algorithms 1(4), 447–460 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fountoulakis, N., Panagiotou, K.: Rumor spreading on random regular graphs and expanders. Random Struct. Algorithms 43(2), 201–220 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Frieze, A., Grimmet, G.: The shortest-path problem for graphs with random arc-lengths. Discret. Appl. Math. 10(1), 57–77 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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) (2011)

    Google Scholar 

  12. Giakkoupis, G., Nazari, Y., Woelfel, P.: How asynchrony affects rumor spreading time. In: PODC ’16, pp. 185–194 (2016)

    Google Scholar 

  13. Gordon, L.: Bounds for the distribution of the generalized variance. Ann. Stat. 17(4), 1684–1692 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mocquard, Y., Robert, S., Sericola, B., Anceaume, E.: Analysis of the propagation time of a rumour in large-scale distributed systems. In: NCA 2016 (2016)

    Google Scholar 

  15. Panagiotou, K., Perez-Gimenez, X., Sauerwald, T., Sun, H.: Randomized rumor spreading: the effect of the network topology. Comb. Probab. Comput. 24(2), 457–479 (2015)

    Article  MATH  Google Scholar 

  16. Panagiotou, K., Pourmiri, A., Sauerwald, T.: Faster rumor spreading with multiple calls. Electron. J. Comb. 22 (2015)

    Google Scholar 

  17. Pourmiri, A., Ramezani, F.: Brief announcement: ultra-fast asynchronous randomized rumor spreading. SPAA 2019 (2019)

    Google Scholar 

  18. Robin, F., Sericola, B., Anceaume, E., Mocquard, Y.: Stochastic analysis of rumor spreading with multiple pull operations. Methodol. Comput. Appl. Probab. 24, 2195–2211 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sanghavi, S., Hajek, B., Massoulié, L.: Gossiping with multiple messages. IEEE Trans. Inf. Theory 53(123) (2007)

    Google Scholar 

  20. Sericola, B.: Markov Chains. Theory, Algorithms and Applications. John Wiley & Sons, Hoboken (2013)

    Google Scholar 

  21. Stroock, D.W.: Probability Theory: An Analytic View, second edition. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  22. Yao, G., Bi, J., Wang, S., Zhang, Y., Li, Y.: A pull model IPv6 duplicate address detection. In: LCN 2010 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre Inria de l’Univ. de Rennes, Irisa, Rennes, France

    Sébastien Kilian & Bruno Sericola

  2. CNRS, Univ. Rennes, Irisa, Rennes, France

    Emmanuelle Anceaume

Authors
  1. Sébastien Kilian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuelle Anceaume
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruno Sericola
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuelle Anceaume .

Editor information

Editors and Affiliations

  1. Università degli Studi della Campania, Caserta, Italy

    Mauro Iacono

  2. Università degli Studi di Messina, Messina, Italy

    Marco Scarpa

  3. Università Cattolica del Sacro Cuore, Brescia, Italy

    Enrico Barbierato

  4. Università degli Studi di Messina, Messina, Italy

    Salvatore Serrano

  5. Università del Piemonte Orientale, Alessandria, Italy

    Davide Cerotti

  6. Universita degli Studi di Messina, Messina, Italy

    Francesco Longo

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kilian, S., Anceaume, E., Sericola, B. (2023). Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes. In: Iacono, M., Scarpa, M., Barbierato, E., Serrano, S., Cerotti, D., Longo, F. (eds) Computer Performance Engineering and Stochastic Modelling. EPEW ASMTA 2023 2023. Lecture Notes in Computer Science, vol 14231. Springer, Cham. https://doi.org/10.1007/978-3-031-43185-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43185-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43184-5

  • Online ISBN: 978-3-031-43185-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation