Rate Limiting Visualizer
Fire requests against token bucket, leaky bucket, or sliding window limiters and compare how bursts are handled.
For the interview design (where to place the limiter, Redis atomicity, fail-open vs fail-closed), see Design a Rate Limiter.
Rate Limiting Algorithms
Send requests against token bucket, leaky bucket, or sliding window and compare accepts vs rejects.
Token bucket allows controlled bursts; leaky bucket smooths traffic; sliding window counts requests in the last N ticks.
Algorithms
| Algorithm | Burst friendly? | Intuition |
|---|---|---|
| Token bucket | Yes | Tokens refill; spend one per request |
| Leaky bucket | No | Smooth outflow; queue/drop excess |
| Sliding window | Medium | Count requests in recent window |