Load balancing and locality in range-queriable data structures

DOI10.1145/1011767.1011785MaRDI QIDQ5501490zbMATH OpenOpenAlexFDO

Authors James Aspnes, Jonathan Kirsch, 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)

Recommendations

• A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
• Simple efficient load-balancing algorithms for peer-to-peer systems
• Algorithms and Computation
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Skip-webs, efficient distributed data structures for multi-dimensional data sets

Cited in

(5)

• On character-based index schemes for complex wildcard search in peer-to-peer networks
• Simple efficient load-balancing algorithms for peer-to-peer systems
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• \(D^2\)-tree: a new overlay with deterministic bounds
• A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems

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

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