Optimal gossip with direct addressing
DOI10.1145/2611462.2611489zbMath1321.68468arXiv1402.2701MaRDI 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
information dissemination; rumor spreading; peer-to-peer (P2P); gossip; pointer jumping; direct addressing
90B18: Communication networks in operations research
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
68W15: Distributed algorithms
Related Items