Consistent hashing distributes cache keys across nodes so that adding or removing a node only affects a small portion of keys.
How it works:
Hash both keys and nodes onto a ring ( to )
Each key maps to the next node clockwise
Adding a node only moves keys between it and its predecessor
Without consistent hashing: Adding node to -node cluster remaps ~% of keys.
With consistent hashing: Same change remaps ~% of keys.