Towards fast decentralized construction of locality-aware overlay networks

DOI10.1145/1281100.1281116zbMath1283.68071OpenAlexW2147380280MaRDI QIDQ5401397

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

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

Related Items (3)

Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ Efficient distributed computation of distance sketches in networks ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network

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