mufassall

Reliability / 2 / 6

Rate limiting

One noisy client can slow an API down for everyone. How to cap each client fairly: windows, token buckets, 429 answers and a counter shared by all servers.

  • 13 min
  • Intermediate
  • 12 steps
Partner p95
2 400 ms
Honest errors
9 %
Over the limit
90 x
Open in Lab

100%95%
  • request
  • reply
  • redelivery
  • duplicate
  • lost
  • call: the reply returns on the same line

Numbers are a model scenario, not measurements

The real request

Script → API

Request

GET /v1/products?page=8812 HTTP/1.12
Host: api.example.com
X-Api-Key1: hidden

Response

HTTP/1.1 200 OK
X-Response-Time3: 2380 ms
  1. X-Api-Key · hidden — The script has a valid key. The requests are allowed, just far too many.
  2. page — Page 8812: nobody reads that far. It is a crawl, not a user.
  3. X-Response-Time — Even this request waited 2.4 s in a queue behind its own siblings.

What happens if…?

Put in your own numbers: the result and the formula update at once.

Tokens returned to the bucket per second: the long-term limit.

The largest burst that passes at once.

Requests per second one client sends.

A batch of requests arriving at once at a full bucket.

Result

Burst passed
25
Burst rejected
0
Passed per second
10/s
Rejected per second (429)
890/s
Share rejected
98.9%

Working

burst: min(B, cap) = min(25, 30) = 25 → 0 × 429
steady: min(R, rate) = min(900, 10) = 10/s
429: 900 − 10 = 890/s = 98.9%

A simplified teaching model: it shows direction and scale, not a benchmark.

Build it yourselfCheat sheetCompare lessons

Course: 74 lessons
  1. 01 Foundations

    1. The life of a request
    2. Latency and throughput
    3. Napkin math
  2. 02 Scaling

    1. Scaling up vs scaling out
    2. Load balancing
    3. Stateless servers
    4. Caching
    5. Cache invalidation
    6. CDN and edge caching
  3. 03 Data & storage

    1. SQL and NoSQL
    2. Database indexes
    3. Geo search: who is nearby
    4. Full-text search
    5. Vector search
    6. Storage engines: B-tree and LSM
    7. Bloom filters
    8. Database replication
    9. Sharding
    10. Consistent hashing
    11. Unique IDs
    12. CAP: when the link breaks
    13. Consensus and leader election
    14. Transactions
    15. File uploads
  4. 04 Communication

    1. API styles
    2. Message queues
    3. Pub/sub and event logs
    4. Real-time updates
    5. Reliable callbacks
    6. Sending webhooks reliably
  5. 05 Reliability

    1. Redundancy and failover
    2. Rate limiting
    3. Timeouts and retries
    4. Observability
    5. SLOs and error budgets
    6. Backpressure
  6. 06 Architecture

    1. Microservices
    2. Service discovery
    3. Sagas and the outbox
    4. Change data capture (CDC)
    5. Transactional outbox
    6. Distributed locks
    7. Batch vs stream
    8. Multi-tenancy
    9. Event sourcing
  7. 07 Security

    1. Authentication
    2. Authorization
    3. Encryption and secrets
    4. Secrets management
  8. 08 Shipping

    1. Testing
    2. CI/CD: from commit to production
    3. Zero-downtime migrations
    4. Feature flags
  9. 09 Whole systems

    1. From requirements to design
    2. Design a URL shortener
    3. Design a news feed
    4. Design a chat
    5. Design a video streaming site
    6. Design search autocomplete
    7. Design a job scheduler
  10. 10 Business processes

    1. Payment gateway
    2. Money and rounding
    3. Double-entry ledger
    4. Payment reconciliation
    5. Subscription billing
    6. Electronic digital signature
    7. Document lifecycle
    8. Audit log
    9. Notification delivery
    10. Bulk import
    11. Refunds and chargebacks
    12. Gapless document numbering
  11. 11 Case studies

    1. Case: how Discord stores messages
    2. Case: Figma multiplayer editing