Rendezvous hashing - Wikipedia

Rendezvous Hashing with n=12, k=4. Clients C1 and C4 independently pick the same random subset of four sites {S2, S5, S6, S10} from among the twelve options S1, S2, ..., S12, for placing replicas or shares of object O. Rendezvous or highest random weight (HRW) hashing[1][2] is an algorithm that allows clients to achieve distributed agreement on a set of options out of a possible set of options. A

[fcicq]

minhash of h(content, location), same goal as consistent hashing. less scalable if n is large