What are virtual nodes and why do they matter?
A physical node doesn't hash to one point on the ring—it hashes to 100 or 150 (typically 100–500) virtual points scattered around it. Each vnode owns a small arc. When a physical node fails, its vnodes' keys spread across many survivors instead of concentrating on one. Load balances better too: if one physical node hashes unluckily on the ring, its vnodes cover more ground.
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.