Rate limiting menghadkan berapa banyak permintaan yang boleh dibuat oleh klien dalam suatu tetingkap masa — melindungi sistem daripada penyalahgunaan, beban berlebihan, dan memastikan penggunaan yang adil. Ia merupakan komponen system design yang lazim, dengan beberapa algoritma dan pertimbangan.
Mengapa rate limiting
✓ PROTECT against abuse → prevent attacks (brute force, scraping, DoS), excessive use
✓ PREVENT OVERLOAD → protect the system from being overwhelmed (stability)
✓ FAIR USAGE → ensure no single client monopolizes resources; tiered limits (free vs paid)
✓ COST control; protect downstream services
→ a common requirement for APIs and services.
Algoritma rate limiting
FIXED WINDOW → count requests per fixed time window (e.g. 100/minute); simple
✗ allows bursts at window boundaries (up to 2x at the edges)
SLIDING WINDOW → rolling time window → smoother, no boundary bursts (more accurate)
TOKEN BUCKET → tokens refill at a rate; each request takes a token → allows BURSTS up to
the bucket size while limiting the average rate (popular, flexible)
LEAKY BUCKET → requests processed at a steady rate (smooths output)
