An overview of rendezvous hashing, a simple way to assign objects to servers without a central coordinator. Each server gets a score from the object and server names, and the highest score wins. Every client reaches the same result, and adding or removing a server moves only the objects affected by that change. The article also compares the method with consistent hashing and covers replication, weights, and faster variants.