Rate Limiting Architecture: Token Bucket vs Sliding Window in a Distributed System
Token bucket and sliding window algorithms have different fairness properties under burst traffic. The Redis Lua script that got us from theory to production.
Token bucket and sliding window algorithms have different fairness properties under burst traffic. The Redis Lua script that got us from theory to production.
Overview
This note is part of the field-notes archive generated for this site. The summary below is the published excerpt; you can expand the full write-up anytime in the CMS.
Related notes
Tags
- rate-limiting
- distributed-systems
- redis
- architecture
- api
Manish Bookreader
Electronics enthusiast, Embedded Systems Expert, Linux/Networking programmer, and Software Engineer passionate about AI, electronics, books, and cooking.