The worst case behavior of randomized gossip protocols

Baumann, Hervé; Fraigniaud, Pierre; Harutyunyan, Hovhannes A.; Verclos, Rémi de Joannis de

doi:10.1016/j.tcs.2014.08.008

Cited by 5 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Section 6, we turn our attention to studying the behavior of the PUSH-PULL algorithm in the mobile telephone model with b = 0 and τ = ∞. 1 Our goal is to determine whether this standard strategy approaches the optimal bounds from Section 5. For the case of vertex expansion, we provide a negative answer by constructing a graph with constant vertex expansion α in which PUSH-PULL requires Ω( √ n) rounds to terminate.…”

Section: Resultsmentioning

confidence: 99%

“…Finally, from a centralized perspective, Baumann et al [1] proved that in a model similar to the mobile telephone model with b = 1 and τ = ∞ (i.e., a model where you can only connect with a single neighbor per round but can learn the informed status of all neighbors in every round) there exists no PTAS for computing the worst-case rumor spreading time for a PUSH-PULL style strategy in a given graph.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

How to Discreetly Spread a Rumor in a Crowd

Ghaffari¹,

Newport

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%