Multi-probe consistent hashing
Abstract
We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 + 1/epsilon lookups per key.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2015
- DOI:
- 10.48550/arXiv.1505.00062
- arXiv:
- arXiv:1505.00062
- Bibcode:
- 2015arXiv150500062A
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- E.2;
- E.1
- E-Print:
- 15 pages, 3 figures