Time-optimal construction of overlay networks

DOI10.1145/3465084.3467932MaRDI QIDQ6830489zbMATH OpenFDO

Authors Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann

Publication date 26 March 2024

Published in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3465084.3467932

zbMATH Keywords

distributed protocolexpanderpeer-to-peer networkrandomized algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Randomized algorithms (68W20)

Cited in

(2)

• Time- and communication-efficient overlay network construction via gossip
• Towards communication-efficient Peer-to-Peer networks

This page was built for publication: Time-optimal construction of overlay networks

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