Routing, fallback, caching, and workload-aware serving
A router assigns each request by capacity, quality, cost, and latency; cache and fallback change the path without removing verification or policy bounds.
Links containing ?t= open the video at a specific second.
Video summary
The ideas to retain
Policy starts with what it cannot choose
Before optimizing quality, cost, or latency, a request needs a set of eligible candidates.
Model routing chooses before the first attempt
Once E(x) has been filtered, a router can select the candidate with the highest expected utility. One conceptual formulation, not a standard, is:
Static routing, explicit rules, and learned routers solve different problems
Key moments
Jump directly to a section
Next step
