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

DOI10.1145/1400751.1400773MaRDI QIDQ5891998zbMATH OpenOpenAlexFDO

Authors Petra Berenbrink, Robert Elsässer, Tom Friedetzky

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

broadcastingrandom regular graphs

Mathematics Subject Classification ID

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

Recommendations

• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Randomized broadcast in networks
• Optimal and near-optimal broadcast in random graphs
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• On Randomized Broadcasting in Power Law Networks
• Close-to-optimal and near-optimal broadcasting in random graphs
• Efficient broadcasting in random power law networks
• Broadcasting in random graphs

Cited in

(17)

• Randomised broadcasting: memory vs. randomness
• Asymptotically optimal randomized rumor spreading
• Introducing Quasirandomness to Computer Science
• Faster rumor spreading with multiple calls
• Perfect broadcasting in unlabeled networks
• Efficient broadcasting in random power law networks
• Randomized broadcast in networks
• The worst case behavior of randomized gossip protocols
• The role of randomness in the broadcast congested clique model
• scientific article; zbMATH DE number 7318978 (Why is no real title available?)
• Choosing a random peer
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Probabilistic flooding for efficient information dissemination in random graph topologies
• Breaking the \(\log n\) barrier on rumor spreading
• Communication complexity of quasirandom rumor spreading
• On Randomized Broadcasting in Power Law Networks
• An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network

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

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