Arc jump: per-key selection of an alternative server when implemented bounded loads

A computer-implemented method comprising:

• arranging a plurality of computing devices, which collectively operate as a distributed system, into a consistent hash ring, wherein each computing devices of the plurality of computing devices is mapped to a location on the consistent hash ring and assigned to store data that is mapped to an arc of the consistent hash ring corresponding to the location;
• obtaining a request to store information within the distributed system;
• mapping the information to a first location on the consistent hash ring based at least partly on a first hash value of the information, the first hash value calculated by passing an initial key of the information through a hash function to result in the first hash value;
• determining that a first computing device, of the plurality of computing devices, that is assigned to store data mapped to the first location, is overloaded;
• mapping the information to an alternative location on the consistent hash ring based at least in part on an alternative hash value of the information, the alternative hash value calculated by passing an alternative key of the information, representing a combination of the initial key and an additional seed value, through the hash function to result in the alternative hash value;
• and
• storing the information on an alternative computing device, of the plurality of computing devices, that is assigned to store data mapped to the alternative location.

One or more non-transitory computer-readable media comprising computer executable instructions for load balancing requests among a plurality of computing devices that collectively operate as a distributed system, wherein the instructions, when executed by a load balancer, cause the load balancer to:

• arrange a plurality of computing devices into a ring, wherein each computing devices of the plurality of computing devices is mapped to a location on the ring and assigned to store data that is mapped to an arc of the ring corresponding to the location;
• obtain a request to store information within the distributed system;
• map the information to a first location on the ring based at least partly on a first hash value of the information, the first hash value calculated by passing an initial key of the information through a hash function to result in the first hash value;
• determine that a first computing device, of the plurality of computing devices, that is assigned to store data mapped to the first location, is overloaded;
• map the information to an alternative location on the ring based at least in part on a alternative hash value of the information that differs stochastically from the first hash value, the alternative hash value calculated by passing an alternative key of the information, representing a combination of the initial key and an additional seed value, through the hash function to result in the alternative hash value;
• and
• store the information on an alternative computing device, of the plurality of computing devices, that is assigned to store data mapped to the alternative location.