Rendezvous hashing

One approach to assign keys to a dynamically changing list of servers. Generates a random permutation of servers for each key; key is “owned” by the first available server in the list. Removing a server only affects those keys who had that server first in their corresponding list.

Rendezvous hashing [Wikipedia]

Is an alternative to _consistent hashing_.

Consistent hashing
Rendezvous hashing overview articles
» Distributed systems