Problems / Resilience, easy

A rate limit below real traffic

A rate limiter in front of the API allows 1,000 req/s. Normal peak traffic is 1,300 req/s, so real users get 429s.

Unlock it once for 10 credits; everything inside it is free (runs, changes, Submit, results, hints). Sign in with Google to start; new accounts get free credits.

Your goals

Success ≥ 99%.

Test cases

Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 4; 1 of them are hidden until then.

  1. As given. The problem’s own traffic, scheduled failures and seed.
  2. A slow dependency. The main data store or model answers twice as slowly for part of the run.
  3. A server dies. One replica of the service with the most replicas is killed for part of the run.

The traffic

1,300 requests a second for 30 seconds: 90% reads, 10% writes.

The system

What each component does in this design, and what calls it. The simulator mimics each one from these settings.

ComponentIts job hereSettings
Rate limiterRate limiterTraffic enters here.Calls Load balancer.Most limiters use a token bucket: tokens refill at the rate, and the bucket size is the burst you allow.1,000 req/s
Load balancerLoad balancerRate limiter forwards to it.Calls API.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header.–
APIApp serviceLoad balancer forwards to it.Calls Redis cache (checked first), Postgres.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 200 slots · timeout 1.0 s
Redis cacheCacheAPI checks it first for reads.An in-memory cache like Redis usually answers in well under a millisecond inside one region.95% hit rate
PostgresSQL databaseAPI reads it when Redis cache misses. API calls it for writes.Postgres runs one process per connection, which is why poolers like PgBouncer sit in front of busy databases.8 vCPU · 60 connections

More resilience problems