Consistent Hashing Simplified

Distributed system problem

We want to dynamically add/remove cache servers based on usage load.

• We should be able to distribute the keys uniformly among the set of “n” servers.
• We should be able to dynamically add or remove a server.
• When we add/remove a server, we need to move the minimal amount of data between the servers.

Refer to below article for detailed explanation

https://towardsdatascience.com/consistent-hashing-simplified-7fe4e512324