Rendezvous hashing is an algorithm to solve the distributed hash table problem - a common and general pattern in distributed systems. There are three parts of the problem: Keys: unique identifiers for data or workloads Values: data or workloads that consume resources Servers: entities that manage data or workloads For example, in a distributed storage system, the key might be a filename, the value is the file data, and the servers are networked data servers that collectively store all of the fil...