The worst case behavior of randomized gossip protocols
From MaRDI portal
Publication:477180
DOI10.1016/j.tcs.2014.08.008zbMath1303.68030OpenAlexW2037067117MaRDI QIDQ477180
Hovhannes A. Harutyunyan, Pierre Fraigniaud, Hervé Baumann, Rémi de Joannis de Verclos
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.008
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network protocols (68M12)
Related Items (1)
Cites Work
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- On the runtime and robustness of randomized broadcasting
- An optimal greedy heuristic to color interval graphs
- On randomized broadcasting in star graphs
- The shortest-path problem for graphs with random arc-lengths
- Methods and problems of communication in usual networks
- Almost tight bounds for rumour spreading with conductance
- Rumor Spreading on Random Regular Graphs and Expanders
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- On Spreading a Rumor
- A survey of gossiping and broadcasting in communication networks
- Partial information spreading with application to distributed maximum coverage
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Broadcasting in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The worst case behavior of randomized gossip protocols
