AIToday
Large Language ModelsDaily Dose of Data SciencePublished: Oct 30, 2026, 06:01 JST

llm-d: prefix-aware routing cuts p90 TTFT from 92.6 to 0.54 seconds

Send on LINE
llm-d: prefix-aware routing cuts p90 TTFT from 92.6 to 0.54 seconds

3 Key Points

  1. What happened

    In llm-d tests on 8 vLLM pods across 16 H100s, precise prefix-aware routing cut p90 time to first token from 92.6 seconds to 0.54 seconds versus random routing, and throughput roughly doubled from 4,429 to 8,730 tokens/s.

  2. Why it matters

    The benchmark shows that where a router sends a request can matter more than how evenly work is spread, since avoiding a full recompute of shared prompt prefixes is what produces the speedup.

Not sure about something? Ask the AI

Questions and answers are published on this page.

Summaries like this, every morning.

Context & Analysis

The llm-d benchmark places routing decisions at the center of LLM serving performance. The test workload simulated 150 customers, each with a 6,000-token shared context and 5 users sending 1,200-token questions, at 3 to 60 QPS. Those shared prefixes needed about 73% of the cluster's KV cache, roughly 6x what one pod could hold, which is the condition under which routing choices matter most.

The gap between routing strategies was wide. Random routing produced a p90 time to first token of 92.6 seconds, load-aware only 94.9 seconds, approximate prefix-aware 31.1 seconds, and precise prefix-aware 0.54 seconds. Load-aware routing did no better than random in this test, because each request landed on a GPU that had to recompute its prefix.

A later llm-d rerun on a newer vLLM, against a plain Kubernetes round-robin Service, showed a smaller gap, but p90 time to first token still dropped by more than 99%. All of this depends on the prefix cache itself working, and a timestamp at the top of a prompt breaks every block after it.

FAQ
What is prefix-aware routing?
It is a routing method that sends each request to the worker already holding the longest matching part of its prompt, so the worker can reuse cached KV blocks instead of recomputing the whole prefix.
How much faster was precise prefix-aware routing than other strategies?
In the llm-d test, p90 time to first token was 0.54 seconds with precise prefix-aware routing, versus 92.6 seconds for random routing, 94.9 seconds for load-aware only, and 31.1 seconds for approximate prefix-aware routing.
What can break the prefix cache match?
A small change early in the prompt, such as a timestamp at the top of the system prompt, changes every block hash after it, so no router can match those blocks. Stable parts should come first and per-request changes last.
Daily Dose of Data ScienceRead Original Article
Send on LINE

AI news that matters for your work, delivered every morning.

Pick your industry and the AI tools you use, and get news related to your work every day.

Free · 30 seconds with Google · unsubscribe anytimeWhat is AIToday? →

Ask AI

Ask AI anything about this article. The AI reads this article, earlier AIToday articles, and Wikipedia, and cites its sources. Q&As are published on this page for other readers too.

Questions and answers are published on this page.

Related Articles

Next articleOpenAI doubles Pro 100 and Pro 500 usage limits