Balanced binary trees for ID management and load balance in distributed hash tables

DOI10.1145/1011767.1011797zbMath1321.68227OpenAlexW2006115592MaRDI QIDQ5501499

Gurmeet Singh Manku

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.1011797

zbMATH Keywords

binary treeDHTpeer-to-peerP2Pdistributed hash tableload balanceID management

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Practical load balancing for content requests in peer-to-peer networks ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ Multiple choice tries and distributed hash tables

This page was built for publication: Balanced binary trees for ID management and load balance in distributed hash tables