Load balancing and locality in range-queriable data structures

DOI10.1145/1011767.1011785zbMath1321.68038OpenAlexW2134237270MaRDI QIDQ5501490

Jonathan Kirsch, James Aspnes, Arvind Krishnamurthy

Publication date: 3 August 2015

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

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

zbMATH Keywords

overlay networkspeer-to-peer systems

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Network protocols (68M12)

Related Items (3)

A novel robust on-line protocol for load-balancing in structured peer-to-peer systems ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ On character-based index schemes for complex wildcard search in peer-to-peer networks

This page was built for publication: Load balancing and locality in range-queriable data structures