Problems / Resilience, easy

Timeout shorter than the call

The search backend takes 80–200 ms. The API gives up after 100 ms.

Solve it in the labTake it as a mock interview

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%, p99 ≤ 1 s.

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 6; 2 of them are hidden until then.

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

The traffic

800 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
Load balancerLoad balancerTraffic enters here.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 Search backend.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 200 slots · timeout 100 ms
Search backendSQL databaseAPI calls it.Postgres runs one process per connection, which is why poolers like PgBouncer sit in front of busy databases.8 vCPU · 200 connections

More resilience problems