Towards fast decentralized construction of locality-aware overlay networks

DOI10.1145/1281100.1281116MaRDI QIDQ5401397zbMATH OpenOpenAlexFDO

Authors Aleksandrs Slivkins

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

triangulationrouting schemesdistance labelinggrid dimensiongrowth-constrained metricslocality-aware networksmulti-cast trees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Internet topics (68M11) Network protocols (68M12)

Recommendations

• T-Man: Gossip-based fast overlay topology construction
• LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
• Locality in structured peer-to-peer networks
• Araneola: a scalable reliable multicast system for dynamic environments
• Algorithms for overlay networks.

Cited in

(7)

• Araneola: a scalable reliable multicast system for dynamic environments
• T-Man: Gossip-based fast overlay topology construction
• Efficient distributed computation of distance sketches in networks
• Low-distortion inference of latent similarities from a multiplex social network
• LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
• Compression and expansion in graphs using overlays
• Dynamic Routing and Location Services in Metrics of Low Doubling Dimension

This page was built for publication: Towards fast decentralized construction of locality-aware overlay networks

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