The server hinting algorithm
Algorithm This is an advanced topic, useful e.g. if you need to change distribution behaviour. The consistent hash beyond this implementation is wheel based. Conceptually this works as follows: each node is placed on a wheel ordered by the hash code of its address. When an entry is added its owners are chosen using this algorithm: key's hash code is calculated the first node on the wheel with a value grater than key's hash code is the first owner for subsequent nodes, walk clockwise and pick nodes that have a different site id if not enough nodes found repeat walk again and pick nodes that have different site id and rack id if not enough nodes found repeat walk again and pick nodes that have different site id, rack id and machine id Ultimately cycle back to the first node selected, don't discard any nodes, regardless of machine id/rack