How asynchrony affects rumor spreading time - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

How asynchrony affects rumor spreading time


In standard randomized (push-pull) rumor spreading, nodes communicate in synchronized rounds. In each round every node contacts a random neighbor in order to exchange the rumor (i.e., either push the rumor to its neighbor or pull it from the neighbor). A natural asynchronous variant of this algorithm is one where each node has an independent Poisson clock with rate 1, and every node contacts a random neighbor whenever its clock ticks. This asynchronous variant is arguably a more realistic model in various settings, including message broadcasting in communication networks, and information dissemination in social networks. In this paper we study how asynchrony affects the rumor spreading time, that is, the time before a rumor originated at a single node spreads to all nodes in the graph. Our first result states that the asynchronous push-pull rumor spreading time is asymptotically bounded by the standard synchronous time. Precisely, we show that for any graph G on n nodes, where the synchronous push-pull protocol informs all nodes within T (G) rounds with high probability, the asynchronous protocol needs at most time O(T (G) + log n) to inform all nodes with high probability. On the other hand, we show that the expected synchronous push-pull rumor spreading time is bounded by O(√ n) times the expected asynchronous time. These results improve upon the bounds for both directions shown recently by Acan et al. (PODC 2015). An interesting implication of our first result is that in regular graphs, the weaker push-only variant of synchronous rumor spreading has the same asymptotic performance as the synchronous push-pull algorithm.
Fichier principal
Vignette du fichier
podc2016_asyncRS.pdf (377.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01353698 , version 1 (12-08-2016)



George Giakkoupis, Yasamin Nazari, Philipp Woelfel. How asynchrony affects rumor spreading time. 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), Jul 2016, Chicago, United States. ⟨10.1145/2933057.2933117⟩. ⟨hal-01353698⟩
368 View
264 Download



Gmail Facebook X LinkedIn More