Analysis of Rumor Spreading with 2-pull or 3-pull Operations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Analysis of Rumor Spreading with 2-pull or 3-pull Operations

Abstract

In this paper, we analyze a new asynchronous rumor spreading protocol to deliver a rumor to all the nodes of a largescale distributed network. This protocol relies on successive pull operations involving k different nodes, with k = 2 or k = 3, and called k-pull operations. Specifically during a k-pull operation, an uninformed node a contacts k − 1 other nodes at random in the network, and if at least one of them knows the rumor, then node a learns it. We perform a detailed study in continuous-time of Θ k,n , the total time needed for all the n nodes to learn the rumor. We obtain, for k ∈ {2, 3}, the mean value, the variance and the distribution of Θ k,n together with their asymptotic behavior when the number of nodes n tends to infinity.
Fichier principal
Vignette du fichier
NCA.pdf (355.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03438975 , version 1 (22-11-2021)

Identifiers

  • HAL Id : hal-03438975 , version 1

Cite

Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume. Analysis of Rumor Spreading with 2-pull or 3-pull Operations. NCA 2021 - 20th IEEE International Symposium on Network Computing and Applications, Nov 2021, Online, France. pp.1-8. ⟨hal-03438975⟩
71 View
58 Download

Share

Gmail Facebook X LinkedIn More