Problems / LLM serving, medium

Model routing sends everything to the big model

A router splits traffic between a large model and a small one, but it is set to send 90% of chats to the large model, which has 200 concurrent streams. 60 chats arrive a second.

Unlock it once for 15 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 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

60 requests a second for 30 seconds: 100% request (reads).

The system

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

ComponentIts job hereSettings
Model routerModel routerTraffic enters here.Calls Large-model path, Small-model path.A router sends easy requests to small, cheap models and hard ones to larger models.100000 slots
Large-model pathApp serviceModel router forwards to it 90% of traffic.Calls Large model.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 500 slots · timeout 30 s
Large modelLLM endpointLarge-model path calls it.Latency has two parts: time to the first token, then a steady stream of tokens per second.200 streams
Small-model pathApp serviceModel router forwards to it 10% of traffic.Calls Small model.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.3 replicas × 500 slots · timeout 30 s
Small modelLLM endpointSmall-model path calls it.Latency has two parts: time to the first token, then a steady stream of tokens per second.600 streams

More llm serving problems