Balanced binary trees for ID management and load balance in distributed hash tables
From MaRDI portal
Publication:5501499
DOI10.1145/1011767.1011797zbMath1321.68227MaRDI QIDQ5501499
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
Related Items
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, Practical load balancing for content requests in peer-to-peer networks, Multiple choice tries and distributed hash tables