Rendezvous Hashing: A Distributed Hashing Algorithm with Excellent Load Balancing

Rendezvous hashing solves the distributed hash table problem by generating a prioritized server list for each key and selecting the first server. Unlike consistent hashing, it offers superior load balancing but has an O(N) lookup time. It's a good choice for small to medium-sized distributed caches, but adding servers in larger systems requires careful management to maintain the "first choice" invariant. Its popularity lagged behind consistent hashing, possibly due to a lack of a 'killer app' moment, despite its earlier invention and inherent advantages.