Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

DOI10.1145/1400751.1400773zbMath1301.68198OpenAlexW2103485813MaRDI QIDQ5891998

Tom Friedetzky, Petra Berenbrink, Robert Elsässer

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/20044/1/20044.pdf

zbMATH Keywords

random regular graphsbroadcasting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (8)

Randomised broadcasting: memory vs. randomness ⋮ The worst case behavior of randomized gossip protocols ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Faster rumor spreading with multiple calls ⋮ Efficient Broadcasting in Random Power Law Networks ⋮ Introducing Quasirandomness to Computer Science ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Communication complexity of quasirandom rumor spreading

This page was built for publication: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems