How asynchrony affects rumor spreading time

DOI10.1145/2933057.2933117MaRDI QIDQ5361933zbMATH OpenOpenAlexFDO

Authors George Giakkoupis, Yasamin Nazari, Philipp Woelfel

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

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

Recommendations

• On the Push&Pull Protocol for Rumor Spreading
• On the Push\&Pull protocol for rumour spreading (extended abstract)
• Asynchronous Rumor Spreading in Preferential Attachment Graphs

Cited in

(8)

• On the Push&Pull Protocol for Rumor Spreading
• The String of Diamonds Is Tight for Rumor Spreading
• Continuous-time stochastic analysis of rumor spreading with multiple operations
• Asymptotics for push on the complete graph
• On the Push\&Pull protocol for rumour spreading (extended abstract)
• Stochastic analysis of rumor spreading with multiple pull operations
• The string of diamonds is nearly tight for rumour spreading
• Asymptotics for pull on the complete graph

This page was built for publication: How asynchrony affects rumor spreading time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361933)