uber-go/ratelimit
Ratelimit
This is a Go library that implements a leaky-bucket algorithm to control the frequency of operations and requests per second. It serves as a concurrent request throttler that blocks calling threads until request slots become available to maintain a steady execution rate.
The project includes a traffic burst controller that allows the accumulation of unspent request capacity, permitting short-term spikes in volume while maintaining a defined long-term average rate.
The library provides capabilities for operation frequency limiting, request interval enforcement, and application resource protection. It also includes a deterministic time simulator and mock clock utilities to verify timing logic and rate limiting behavior without waiting for real-time intervals.
Features
- Leaky Bucket Algorithms - Implements a leaky-bucket algorithm to maintain a steady execution rate for requests.
- Frequency Limiters - Blocks the calling thread until a slot becomes available based on a defined operations-per-second limit.
- Traffic Burst Management - Allows short-term spikes in request volume while maintaining a defined long-term average rate.
- Rate Limiting Algorithms - Uses a leaky-bucket algorithm as the steady-state execution controller to maintain consistent operation rates.
- Leaky Bucket Implementations - Provides a Go library implementing the leaky-bucket algorithm to control operation frequency.
- Burst Capacity Accumulators - Implements a burst controller that allows the accumulation of unspent request capacity for short-term traffic spikes.
- Burst Capacity Management - Enables the accumulation of unspent request slots to permit short bursts of traffic.
- Traffic Burst Controllers - Provides a mechanism for accumulating unspent request capacity to allow short bursts of traffic.
- Traffic Flow Control - Regulates the number of requests a service handles per second to prevent system overload.
- Request Rate Limiting - Blocks subsequent calls until the required time interval for a specified rate has elapsed.
- Request Throttlers - Ships a concurrent request throttler that blocks calling threads until request slots become available.
- Wait-Based Execution Throttling - Blocks calling threads using sleep intervals to ensure operations do not exceed the defined frequency.
- Integer Atomic Operations - Uses lock-free atomic integer operations to ensure thread-safe updates to internal state during high concurrency.
- Deterministic Testing Clocks - Provides an interface-based clock to allow deterministic testing by simulating time progression.
- Denial of Service Prevention - Prevents services from being overwhelmed by traffic spikes by limiting incoming request frequency.
- Execution Timestamp Tracking - Maintains internal timestamps of the last execution to calculate necessary wait periods.
- Time Simulation Utilities - Implements a custom clock that simulates the passage of time for deterministic testing of rate limits.
- Rate Limiting - High-performance rate limiting implementation for Go applications.
Star history
How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.
