Faster construction of overlay networks

DOI10.1007/978-3-030-24922-9_18MaRDI QIDQ2303294zbMATH OpenOpenAlexFDO

Authors Thorsten Götte, Kristian Hinnenthal, Christian Scheideler

Publication date 3 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24922-9_18

zbMATH Keywords

overlay networkspeer-to-peerpointer jumping

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Towards fast decentralized construction of locality-aware overlay networks
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• On underlay-aware self-stabilizing overlay networks
• Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
• T-Man: Gossip-based fast overlay topology construction

Cited in

(4)

• Distributed computation and reconfiguration in actively dynamic networks
• The complexity of growing a graph
• The complexity of growing a graph
• Overlay network construction: improved overall and node-wise message complexity

This page was built for publication: Faster construction of overlay networks

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