Leaking bucket rate limiting algorithm is… #flashcard Idea: Requests are queued in a bucket and leave (get processed) at a fixed rate. If the bucket is full, new requests are dropped. - Pros: - Enforces a strict rate. - Prevents burstiness (only one leaves at a time). Use case: Scenarios where a constant processing rate is needed regardless of input rate (e.g., queueing jobs for a rate-limited resource). - Analogy: Water drips out of a leaky bucket at a steady rate; if too much water (requests) comes in too fast, it overflows (drops requests). <!--ID: 1753886610131-->