
Think of it as a meta model, right? That’s the most important thing.来源Morgan Stanley TMT Conference · 2026
面向模型与算力的开放、可编程决策层。
来自社区的演示、部署与想法。
为每次请求选择模型与算力。
各有所长,组成统一模型池。
路由到你配置的后端。
由你配置推理运行的位置。
为每项任务设置优先级。


为每个请求带来合适的智能。
上下文、意图、安全、偏好与系统状态。
11 种选择算法,5 种协作循环。
19 篇关于路由、安全与推理的论文。
通过决策引擎路由聊天请求,或直接调用模型智能。两条路径共享前端和可扩展的服务引擎。
监听器、身份验证与 API 契约。
/v1/chat/completions/v1/responses/v1/systemone别名:/v1/decisions每个入口解析到独立的配方。
先选择模型部署,再分配就绪副本。
将 Chat、Messages 和 Responses 请求路由到模型后端,同时保留原生决 策能力。
vllm-sr serve vllm-sr/Decision-2.0-Kai-0.6B调用 /v1/chat/completions 或 /v1/messages。
启动相同的前端和模型工作进程,并关闭路由。后续逻辑由你的应用掌控。
vllm-sr serve -e vllm-sr/Decision-2.0-Kai-0.6B通过 /v1/systemone 调用明确指定的已发布模型。
开发通道在 CLI 启动时选择组件组合。
让私有领域知识留在本地,用你的 GPU 运行开放模型。对路由策略允许的请求,使用外部前沿模型。
动画展示一种配置好的隐私策略:内部领域知识路由到本地 GPU 上的开放模型;公开请求符合策略时,可以使用外部前沿闭源模型。隐私、处理位置和访问约束先于模型选择。
推动推理进步的想法。
vLLM Semantic Router Team
arXiv 技术报告
We introduce vLLM Semantic Router, a signal-driven decision routing framework for Mixture-of-Modality deployments that composes heterogeneous signals into deployment-specific routing policies across cost, privacy, latency, and safety constraints.
Huamin Chen, Xunzhuo Liu, Bowei He, Fuyuan Lyu, Yankai Chen, Xue Liu, Yuhan Liu, Junchen Jiang
arXiv 技术报告
We synthesize the project’s recent routing, fleet, multimodal, and governance results into the Workload-Router-Pool (WRP) architecture, connecting signal-driven routing to a full-stack inference optimization framework and outlining future research directions across workload, router, and pool design.
Xunzhuo Liu, Bowei He, Xue Liu, Andy Luo, Haichen Zhang, Huamin Chen
arXiv 技术报告
We formalize the visual confused deputy as a security failure mode in computer-using agents and introduce a dual-channel guardrail that independently checks click targets and action reasoning before execution.
Huamin Chen, Xunzhuo Liu, Junchen Jiang, Bowei He, Xue Liu
arXiv 技术报告
We introduce Outcome-Aware Tool Selection (OATS), an offline embedding refinement method that improves semantic-router tool ranking under single-digit millisecond CPU budgets without adding serving-time model inference.
Xunzhuo Liu, Bowei He, Xue Liu, Andy Luo, Haichen Zhang, Huamin Chen
arXiv 技术报告
We propose Adaptive VLM Routing (AVR), which estimates action difficulty and routes computer-use agent steps to the cheapest model that still satisfies a target reliability threshold.
Xunzhuo Liu, Bowei He, Xue Liu, Andy Luo, Haichen Zhang, Huamin Chen
arXiv 技术报告
We combine Flash Attention, prompt compression, and near-streaming body processing to cut routing latency from seconds to tens of milliseconds while keeping the router lightweight enough to share hardware with serving.
Huamin Chen, Xunzhuo Liu, Yuhan Liu, Junchen Jiang, Bowei He, Xue Liu
arXiv 技术报告
We present a queueing-theory-grounded fleet planner and discrete-event simulator for sizing multi-pool LLM GPU fleets against P99 TTFT targets, without requiring hardware profiling runs up front.
Huamin Chen, Xunzhuo Liu, Yuhan Liu, Junchen Jiang, Bowei He, Xue Liu
arXiv 技术报告
We derive the minimum-cost two-pool LLM fleet directly from the workload CDF and P99 TTFT target, then use Compress-and-Route to make the optimal boundary deployable in practice.
Huamin Chen, Xunzhuo Liu, Yuhan Liu, Junchen Jiang, Bowei He, Xue Liu
arXiv 技术报告
We derive the 1/W law showing that tokens per watt roughly halve whenever the serving context window doubles, making context-length routing topology a larger energy-efficiency lever than a pure GPU generation upgrade.