SlidingWindowSemaphoreBasedRateLimiter
A counting suspendable Semaphore based implementation of a rate limiter that uses the sliding window counter algorithm to control the number of permits available for requests. The sliding window counter algorithm divides the time window into smaller segments and maintains a count of requests in each segment. As time progresses, the window slides over these segments to provide a smoother rate limiting mechanism compared to fixed window counters.
Considerations
The sliding window counter algorithm helps to prevent bursts of requests and provides a more even distribution of traffic.
Parameters
The configuration for the rate limiter mechanism.
The state of the semaphore which includes an internal in-memory queue to store the excess requests.
See also
Throws
if the coroutine is cancelled while waiting for the permits to be available.
if the request is rejected due to the queue being full or the acquisition timeout being exceeded.
Properties
Functions
Calculates the duration after which the request can be retried. The retry duration depends on the rate limiting algorithm, the current state of the semaphore and the number of permits requested. For example, a token bucket algorithm may return a retry duration based on the time left until the requested permits are available (which may not happen in the next replenishment period).
Creates a RateLimiterRejectedException with the appropriate retry duration.
Deals with the caught exception while maintaining the integrity of the semaphore state.
Determines if the request should be rate limited based on the current state of the semaphore.
Depending on the rate limiting algorithm, this function is responsible for replenishing the semaphore state. For example, a fixed window counter algorithm may reset the permits to zero at the end of the window. And a token bucket algorithm may refill the bucket with tokens at a constant rate.
Updates the number of permits in the semaphore state.