The paper introduces two algorithms—CUCB‑SC‑MT and CLCB‑LS‑MT—for multi‑turn semantic caching in large language model serving. These methods learn a "reuse risk" metric from judge feedback to decide which conversation states to cache, balancing avoided generation cost against the risk of unacceptable reuse. Experiments on math‑tutoring and movie‑ticketing dialogues show that the online CLCB‑LS‑MT algorithm reduces generation cost by 35–41% and estimated latency by 19–35% compared to prior caching approaches.
By Baran Atalar, Selly Beyene, Xutong Liu, Carlee Joe-Wong
arXiv:2606.27457v2 Announce Type: replace-cross
Abstract: Serving open-weight language models on premises forces a trade-off between accuracy and computational cost. Hosting models of different sizes...
By Yasmin Moslem, Magdalena Kacmajor, Vasudevan Nedumpozhimana, Ammar Abbas, Solmaz Panahi, David Lynch, Zhuangzhuang Nie, Alexandros Agapitos, Aleksandar Milenovic, Hongmeng Song, Yucheng Shi, Yue Pan, Patricia Buffini, John D. Kelleher
arXiv:2606.00756v2 Announce Type: replace
Abstract: LLM-based Web agents are increasingly deployed on edge servers to carry out long-horizon tasks on behalf of users with low latency. However, the li...
By Yannan Wang, Longli Yang, Zhen Liu, Abhishek Kumar, Carsten Maple
The paper presents a carbon‑aware routing framework for function‑calling in large language models that distributes queries across a three‑tier edge‑cloud architecture. A lightweight k‑NN predictor estimates accuracy, delay, and power for each edge tier, and real‑time grid carbon intensity is used to route queries to the lowest‑emission tier that can execute them. Experiments on state‑of‑the‑art benchmarks show the framework matches cloud‑level accuracy while cutting operational carbon emissions by an average of four times.
By Aikaterini Maria Panteleaki, Varatheepan Paramanayakam, Spyros Tragoudas, Iraklis Anagnostopoulos
Model routing can reduce the cost of LLM applications by assigning simpler requests to cheaper models without sacrificing the quality of the response. However, most routers treat requests as independe...
The paper introduces BEA, a fine‑grained estimator that predicts the time‑to‑first‑token (TTFT) for language model queries by replaying token‑batch formation based on current workload snapshots. BEA achieves about 5% error with 0.1 ms prediction time, enabling the latency‑aware router BEAR to balance accuracy, cost, and latency across heterogeneous LLM pools. BEAR outperforms seven baselines, improving utility of on‑target responses by 63% on average and by 30.5% at each arrival rate.
By Shivam Patel, Akaash R. Parthasarathy, Akash Dhasade, Ankur Mallick, Gauri Joshi