How Asynchrony Affects Rumor Spreading Time

DOI10.1145/2933057.2933117zbMath1373.68047OpenAlexW2495546859MaRDI QIDQ5361933

Philipp Woelfel, Yasamin Nazari, George Giakkoupis

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933117

zbMATH Keywords

randomized rumor spreadingasynchronous vs synchronous modelspush-pull algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (8)

Stochastic analysis of rumor spreading with multiple pull operations ⋮ On the Push&Pull Protocol for Rumor Spreading ⋮ Continuous-time stochastic analysis of rumor spreading with multiple operations ⋮ Asymptotics for pull on the complete graph ⋮ The String of Diamonds Is Tight for Rumor Spreading ⋮ Asymptotics for push on the complete graph ⋮ Rumor spreading with bounded in-degree ⋮ The string of diamonds is nearly tight for rumour spreading

This page was built for publication: How Asynchrony Affects Rumor Spreading Time