English

Multi-probe consistent hashing

Data Structures and Algorithms 2015-05-04 v1

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.

Keywords

Cite

@article{arxiv.1505.00062,
  title  = {Multi-probe consistent hashing},
  author = {Ben Appleton and Michael O'Reilly},
  journal= {arXiv preprint arXiv:1505.00062},
  year   = {2015}
}

Comments

15 pages, 3 figures

R2 v1 2026-06-22T09:26:22.754Z