Consistent Hashing

Distributing keys across a changing set of cache nodes while minimizing remapping.

Edit Concept ✏️

Consistent Hashing

Consistent hashing maps keys to nodes so adding or removing a node remaps only part of the keyspace. Virtual nodes improve distribution when node capacity or key distribution is uneven.

Hash Ring 0 to 2^32-1

Node A

Key 1

Node B

Key 2

Node C

Key 3