# Pulling multiple nodes for rumor spreading

1 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
CentraleSupélec, Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
2 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS
Inria Rennes – Bretagne Atlantique , IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
Abstract : In this paper, we propose and analyze a new asynchronous rumor spreading protocol to deliver a rumor to all the nodes of a large-scale distributed network. This spreading protocol relies on what we call a k-pull operation, with $k ≥ 2$. Specifically during a k-pull operation, an uninformed node i contacts $k − 1$ random nodes in the network, and if at least one of them knows the rumor, then node i learns it. We perform a thorough study of $T k,n ,$ the total number of k-pull operations needed for all the nodes to learn the rumor. We prove that the mean number of interactions needed for all the nodes to be informed is in $O (n ln(n)/(k − 1))$, which generalizes the standard case $k = 2$ for the push-pull, push and pull protocols. We also analyze the tail of $T k,n$ and prove that $T k,n < cE(T k,n)$ almost surely for any $c ∈ (0, 1)$ when n tends to infinity. Finally, we prove that when $k > 2$, our new protocol requires less operations than the traditional push-pull or push (resp. pull) protocols by using stochastic dominance arguments.
Document type :
Preprints, Working Papers, ...
Domain :

Cited literature [29 references]

https://hal.archives-ouvertes.fr/hal-02500504
Contributor : Emmanuelle Anceaume <>
Submitted on : Friday, March 6, 2020 - 8:48:45 AM
Last modification on : Friday, January 8, 2021 - 3:37:31 AM
Long-term archiving on: : Sunday, June 7, 2020 - 1:26:28 PM

### File

main.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-02500504, version 1

### Citation

Frédérique Robin, Bruno Sericola, Emmanuelle Anceaume, Yves Mocquard. Pulling multiple nodes for rumor spreading. 2020. ⟨hal-02500504⟩

Record views