DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead

DOI10.1145/3382734.3405716MaRDI QIDQ5855269zbMATH OpenOpenAlexFDO

Authors Gopal Pandurangan, Peter Robinson, Amitabh Trehan, Seth Gilbert

Publication date 15 March 2021

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

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

zbMATH Keywords

distributed protocolexpanderpeer-to-peer networkrandomized algorithmself-repairing network

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(6)

• The complexity of growing a graph
• Applications and Implications of a General Framework for Self-Stabilizing Overlay Networks
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• The complexity of growing a graph
• Time- and communication-efficient overlay network construction via gossip
• Towards communication-efficient Peer-to-Peer networks

This page was built for publication: DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead

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