Perfect Consistent Hashing
Matthew Sackman

TL;DR
This paper introduces a new consistent hashing algorithm that achieves perfect, non-random allocation of keys, improving load balancing without relying on randomness.
Contribution
It presents a simple, deterministic algorithm for consistent hashing that guarantees desired properties without using random distributions.
Findings
The algorithm achieves perfect consistency in key distribution.
It simplifies the understanding of necessary conditions for consistent hashing.
The method improves load balancing accuracy in distributed systems.
Abstract
Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which results in a flawed and approximately-uniform allocation of keys to hash codes. We analyse the desired properties and present an algorithm that perfectly achieves them without resorting to any random distributions. The algorithm is simple and adds to our understanding of what is necessary to create a consistent hash function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Caching and Content Delivery · Error Correcting Code Techniques
