arXiv:2606.00946cs.DCcs.AI2026-06

Lodestar通过在线学习优化LLM推理请求路由,显著降低延迟。

Lodestar: An Online-Learning LLM Inference Router

论文配图:Lodestar: An Online-Learning LLM Inference Router
图 1 · 摘自论文原文
  • 基于实时状态在线训练奖励预测器,动态分配请求到最优GPU
  • 平均TTFT降低41%,P99 TTFT降低47%,在异构集群中提升超4倍
  • 5分钟内自适应学习,兼容现有推理框架,适合大规模部署

高效服务大语言模型(LLM)推理任务对用户感知延迟(如首令牌时间TTFT)和GPU利用率至关重要。然而,请求路由——即为每个推理请求分配至合适的GPU实例——极具挑战性:执行高度依赖输入;批处理与键值缓存复用造成强跨请求耦合;延迟对上下文长度、模型/引擎设置及异构加速器呈非线性响应。因此,传统负载均衡算法乃至专为LLM设计的启发式方法均难以达到理想性能。我们提出Lodestar,一种面向分布式GPU集群的新型学习型请求路由系统。Lodestar持续收集每请求级别的集群快照,包括实时实例状态、请求特征与观测性能,并训练在线奖励预测器,以将请求路由至能最大化奖励(如最小化TTFT)的实例。Lodestar为云原生设计,可无缝集成现有推理栈(vLLM)。通过持续在线适应变化的工作负载与基础设施条件,在公共云GPU集群实验中,相比最先进的前缀缓存与负载感知启发式方法,平均TTFT降低1.41倍,P99 TTFT降低1.47倍(同构集群最高达2.15倍/1.86倍,异构集群最高达4.38倍/4.42倍),且在约5分钟内学会高效路由策略。

原文摘要 · Abstract (English)

Efficiently serving large language model (LLM) inference tasks is crucial both for user-perceived latency such as time-to-first-token (TTFT) and for GPU utilization. However, LLM request routing, that is, assigning each inference request to a GPU instance, is particularly challenging: execution is highly input-dependent; batching and KV-cache reuse create strong cross-request coupling; and latency responds nonlinearly to context length, model/engine settings, and heterogeneous accelerators. As a result, simple traditional load balancing algorithms, and even heuristics tailored for LLM inference, fail to achieve good performance. We present Lodestar, a novel learning-based request routing system for distributed GPU clusters. Lodestar continuously collects a snapshot of the cluster at per-request level, including real-time instance state, request characteristics, and observed performance, and trains an online reward predictor that it uses to route inference requests to the instance that will maximize given reward (e.g., minimizing TTFT). Lodestar is cloud-native and works seamlessly with existing serving stacks (vLLM). With continuous online adaptation to changing workloads and infrastructure conditions, Lodestar achieves 1.41x lower average TTFT and 1.47x lower P99 TTFT on average (up to 2.15x/1.86x on homogeneous and 4.38x/4.42x on heterogeneous clusters) compared to a state-of-the-art prefix cache and load-aware heuristic, and learns these efficient routing strategies within about 5 minutes, based on experiments in a public cloud GPU cluster.

LLM推理请求路由在线学习延迟优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。