Rate Limiting Algorithms

Summary

In a system-design context: comparing fixed window, sliding window, token bucket and leaky bucket algorithms for their trade-offs in fairness, burst handling and implementation complexity.

• 1Implement both a fixed window and a token bucket rate limiter and compare their behavior.
• 2Learn why token bucket allows controlled bursts while fixed window can allow a burst right at window boundaries.
• 3Be ready to design one of these from memory — it's a common system design interview question.