US 2026/0230437 A1 · NOISY NEIGHBOR THROTTLING

Abstract

Improved solutions for noisy neighbor throttling (1) ensure that global capacity is not exceeded, (2) allow use of idle resources without a need to specify exceptions, and (3) focus throttling on misbehaving actors (“noise neighbors”) first, while avoiding throttling well-behaved ones. A trigger point is set for initiating throttling for a server, and requests are received from multiple clients. In each timeslot, a total request count and a client-specific request count is determined. The client-specific request counts are sorted in descending order in a list. Efficient single-swap sorting may be used for speed. If the total request count meets the trigger point during a timeslot, the client with the highest request count is readily-identifiable at the top of the sorted list, and that client is throttled. If, while that client is still being throttled, the trigger is hit again and that client still tops the list, the throttling is enhanced.

Claims20

Dependent claims

A system comprising:

a processor;
and
a computer-readable medium storing instructions that are operative upon execution by the processor to:
identify a trigger point at which to initiate throttling for a server;
receive, at the server, requests from a plurality of clients in each time slot of a plurality of time slots;
determine, during each time slot of the plurality of time slots, a total request count identifying a count of the requests accepted during the time slot;
update a client list with a client request count identifying a count of the requests accepted, from each client of the plurality of clients, during the time slot;
and
based on at least determining that the total request count meets the trigger point during a first time slot:
identify a first client as having a highest client request count of the client list;
and
throttle the first client according to an acceptance rate for the first client.

9 more elements

A computer-implemented method comprising:

identifying a trigger point at which to initiate throttling for a server;
receiving, at the server, requests from a plurality of clients in each time slot of a plurality of time slots;
determining, during each time slot of the plurality of time slots, a total request count identifying a count of the requests accepted during the time slot;
updating a client list with a client request count identifying a count of the requests accepted, from each client of the plurality of clients, during the time slot;
and
based on at least determining that the total request count meets the trigger point during a first time slot:
identifying a first client as having a highest client request count of the client list;
and
throttling the first client according to an acceptance rate for the first client.

6 more elements

A computer storage device having computer-executable instructions stored thereon, which, on execution by a computer, cause the computer to perform operations comprising:

identifying a trigger point at which to initiate throttling for a server;
receiving, at the server, requests from a plurality of clients in each time slot of a plurality of time slots;
determining, during each time slot of the plurality of time slots, a total request count identifying a count of the requests accepted during the time slot;
updating a client list with a client request count identifying a count of the requests accepted, from each client of the plurality of clients, during the time slot;
and
based on at least determining that the total request count meets the trigger point during a first time slot:
identifying a first client as having a highest client request count of the client list;
and
throttling the first client according to an acceptance rate for the first client.

6 more elements

Dependencies are inferred from the claim text.

Noisy neighbor throttling

Life of this patent

Noisy neighbor throttling

Life of this patent

Abstract

Claims20