Level 3: Distributed systems · L3.2 Timeouts, retries, idempotency, rate limiting, circuit breakers
Rate limiting algorithms
Compare token bucket, leaky bucket, fixed and sliding windows.
13 min · Pro
What you take away
- A fixed window is trivial and allows twice the limit across a boundary; sliding windows fix that at some cost.
And 3 more inside the class, in Pro.
How the class is laid out
- The problem
- Check your understanding