consistent hashing
Limit key reassignment when the set of storage nodes changes.
Use this when Adding a cache or storage node should not remap nearly every key.
without the term
“Adding a storage node should move a limited share of keys rather than changing nearly every assignment.”
with the term · How do you ask a model for consistent hashing?
Evaluate consistent hashing for this routing layer. Measure key movement, load balance, and replica placement on node changes.
What is consistent hashing?
Consistent hashing assigns keys and nodes in a stable hash space. Adding or removing nodes moves a subset of assignments; virtual nodes can improve distribution. It differs from taking a hash modulo a changing node count.
Why does consistent hashing matter when vibe coding?
An agent can call modulo-based routing consistent hashing and trigger a near-total cache miss storm on resize.
How do you do consistent hashing?
Compare key assignments before and after a node change. Measure moved keys, per-node load, and replica placement, and plan any state transfer.
What goes wrong with consistent hashing?
Fewer moved keys does not mean zero migration, balanced hot-key traffic, or safe membership changes.
Sources for this entry
- DeCandia et al.: Dynamo
Consistent hashing, virtual nodes, replica quorums, version reconciliation, and eventual consistency.
Sources checked . Source checks do not establish human editorial approval. How we check content.