Tier 1 of plan §7.5: a radix tree of request prefixes that estimates which replica has already prefilled one. Bytes, not tokens — needing the engine's exact tokenizer is what makes tier 2 a separate project. It went in inert, and the decision metric is what caught it: 144 lookups, zero hits. The cause was a rule I had written and tested for. A node's label is the first request that created it, so the second request for the same system prompt diverges in its last few bytes — a new question after the same preamble, the single most common shape there is. Requiring the whole label to match threw away the 700 bytes they shared. What matters is the shared head, because that is what the engine cached, and a partial label match now counts. Two unit tests asserted the wrong rule and have been inverted. With that fixed, measured end to end against engines whose caches are too small for the working set: 22.5% cache hits without, 81.7% with, and the breakdown shows the misses are exactly the first round, when the tree is empty. The scenario matters as much as the number. With a handful of prompts and a large cache, scattering is free — every replica ends up holding everything — and prefix routing can only add constraint. The first version of the test measured that case and showed a loss, which was a true statement about a situation the feature is not for. Two things keep it from being the disaster prefix routing usually is. The imbalance guard, which needs both an absolute and a relative gap before it fires, because either alone misfires — absolute on an idle cluster, relative on a busy one. And it is a scorer rather than a filter: affinity is a vote the queue and inflight scorers can outvote, not a rule. The tree records the replica the picker actually chose, not the one the scorer proposed, and a node prefers the replica it has seen most rather than most recently — a count is stable under a randomizing picker, where recency just chases whatever the picker last did. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
This commit is contained in:
1 parent
de21649ad6
commit
a075ff4120
13 files changed
+1207
-7
No files matched your search
@@ -149,6 +149,11 @@ type Router struct {
|
||||
|
||||
// DefaultProfile names the routing profile used when a model picks none.
|
||||
DefaultProfile string `koanf:"default_profile"`
|
||||
// Prefix turns on the approximate prefix tree (plan §7.5 tier 1). Off, the
|
||||
// router uses session affinity alone, which is tier 0 and already most of
|
||||
// the win for multi-turn traffic.
|
||||
Prefix Prefix `koanf:"prefix"`
|
||||
|
||||
// SessionHeader carries the session id for affinity (plan §7.5 tier 0).
|
||||
SessionHeader string `koanf:"session_header"`
|
||||
// InjectUsage asks engines for usage even when the client did not, so token
|
||||
@@ -181,6 +186,24 @@ type Admission struct {
|
||||
Interval time.Duration `koanf:"interval"`
|
||||
}
|
||||
|
||||
// Prefix configures approximate prefix routing.
|
||||
type Prefix struct {
|
||||
Enabled bool `koanf:"enabled"`
|
||||
// MaxNodes bounds the tree, MinMatch is the shortest match worth acting on
|
||||
// in bytes, and TTL is how long an entry is believed — an engine evicts on
|
||||
// its own schedule, so an old record may describe a cache that is gone.
|
||||
MaxNodes int `koanf:"max_nodes"`
|
||||
MinMatch int `koanf:"min_match"`
|
||||
TTL time.Duration `koanf:"ttl"`
|
||||
|
||||
// MatchRatio is the share of the prompt that must match to be worth acting
|
||||
// on. BalanceAbs and BalanceRel are the imbalance guard, and both must trip
|
||||
// before affinity is abandoned.
|
||||
MatchRatio float64 `koanf:"match_ratio"`
|
||||
BalanceAbs float64 `koanf:"balance_abs"`
|
||||
BalanceRel float64 `koanf:"balance_rel"`
|
||||
}
|
||||
|
||||
// Band is one priority class.
|
||||
type Band struct {
|
||||
Name string `koanf:"name"`
|
||||
|
||||
Reference in new issue
Block a user