Rendezvous hashing

Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible set of n options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. Consistent hashing addresses the special case k=1 using a different method. Rendezvous hashing is both much simpler and more general than consistent hashing (see below).
Wikipedia contributors, "Rendezvous hashing", Wikipedia, revision 1384056162, retrieved 20 November 2026, source, CC BY-SA 4.0.