Application: Rate Limit

The bucket(analog to a server processing request) process(leak) at a constant rate, where every request is represented by a drop of water that enters the bucket. When the bucket is full, any incoming request is rejected or queued

Burst

The leaky bucket algorithm smooths out bursts by processing requests at a constant rate