Optimal gossip with direct addressing

DOI10.1145/2611462.2611489zbMath1321.68468arXiv1402.2701OpenAlexW2071202952MaRDI QIDQ2943620

Bernhard Haeupler, Dahlia Malkhi

Publication date: 3 September 2015

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

Full work available at URL: https://arxiv.org/abs/1402.2701

zbMATH Keywords

information disseminationrumor spreadingpeer-to-peer (P2P)gossippointer jumpingdirect addressing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Breaking the \(\log n\) barrier on rumor spreading

This page was built for publication: Optimal gossip with direct addressing