What happens when a node fails in a consistent hash ring?
The failed node sits on the ring but no client can reach it. Keys that belonged to that node walk clockwise to the next live node. If the ring had 4 nodes and one dies, roughly 1/3 of keys rehash to one of the 3 survivors. If you use virtual nodes, fewer keys move because they're spread across multiple vnodes.
Answered in
When 87% of Your Cache VanishesConsistent hashing maps nodes and keys to a circle, so adding a server moves only 1/N of keys instead of almost all of them.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.