Aug 2026· International journal of computer information systems and industrial management applications· Vol 18, pp. 232-242· 0 citations
TL;DR
A framework is intended as a design reference for practitioners building inference gateways and as a structuring basis for future empirical work on multi-objective LLM request scheduling, and an evaluation protocol comprising workload definitions, baselines, and metrics is specified.
Abstract
Large Language Model (LLM) serving infrastructure has evolved from single-model deployments into heterogeneous fleets combining general-purpose models, domain-specialised variants, multimodal models, and quantised derivatives with widely differing context capacities. In such environments, the decision of which endpoint should serve a given request materially affects latency, throughput, monetary cost, and output quality. Despite growing industrial adoption of inference routers, the literature lacks a consolidated account of the decision dimensions such systems must reason over, or of how those dimensions interact when their objectives conflict. This paper addresses that gap. Through an analysis of inference-serving mechanisms and model-specialisation results, we identify and characterise six dimensions governing endpoint selection: load distribution, context-length requirement, input modality, task category, domain specialisation, and prefix-cache locality. For each dimension we formalise the decision criterion and describe the signals available at request-admission time, distinguishing hard feasibility constraints from soft optimisation preferences. We further show that these dimensions are not independent - notably, cache-locality routing and load-balancing objectives are structurally opposed, since the former concentrates traffic while the latter disperses it - and we propose a bounded-affinity policy and a priority-ordered evaluation sequence to resolve such conflicts. Finally, we specify an evaluation protocol comprising workload definitions, baselines, and metrics, by which implementations of the framework may be empirically validated and compared. The framework is intended as a design reference for practitioners building inference gateways and as a structuring basis for future empirical work on multi-objective LLM request scheduling.
LLM-Advisor is introduced, an open-source, adaptive framework designed for intelligent query categorization, dynamic model evaluation, and constraint-aware request routing across heterogeneous multi-LLM pools that achieves a 42% reduction in overall inference expenditure and a 35% decrease in average response latency.
Harshil Lodhiya· International Journal of Res...· 0 citations
This work extends Llumnix's priority model to support an arbitrary number of tiers and evaluates the effects of this extension under three realistic priority distributions (uniform, Gaussian, enterprise) using Vidur, a high-fidelity LLM inference simulator.
Anders Vestrum, Arya Raeesi, Hanna Roed· 0 citations
As large language model (LLM) agents move from isolated prompting to longhorizon workflows, failures increasingly arise at the role-to-instance binding boundary, where task-specific role requests must be assigned to concrete agent instances under current service, network, and query conditions. Existing agent system research has improved role specialization, workflow topology, memory, and tool use, but often assumes a fixed stable execution environment. This assumption limits deployed reliability, because the same role request can exhibit different latency, failure probability, and output quality across agent instances operating under different service regions and network conditions. We propose Hedged Agent Computing (HACO), a runtime control scheme that treats each role request as a reliability-constrained selection problem over candidate agent instances, each coupling a role type, an LLM, and a concrete execution environment. Different from routing, HACO adaptively selects a hedge set of candidates for each invocation. Its allocation rule combines optimistic ranking, which prioritizes candidates with high estimated quality, reliability, and informative uncertainty, with conservative reliability accumulation, which stops selection only after the hedge set reaches a target success probability. Through experience harvesting, HACO updates candidate and link profiles from all executed candidate traces, including quality, success, latency, and network statistics. Experiments on various benchmarks, together with runtime degradation studies, show that HACO improves robustness and output quality under changing deployment conditions, while using lower token and latency cost than exhaustive parallel execution.
Cascade, an LLM serving system that estimates and continuously updates this per-request latency budget from request characteristics, KV-cache state, and current system load, and uses a single per-request budget to jointly coordinate request scheduling and KV-cache management across the memory hierarchy.
Muhammad Adnan, R. Mahapatra, Prashant J. Nair et al.· 0 citations
This survey presents a systematic taxonomy and technical review of dynamic orchestration strategies designed to address communication overhead, KV cache management challenges, and increased token consumption within large Language Model-based Multi-Agent Systems.
Heet Nagoriya, H. Raithatha· International Journal of Kno...· 0 citations
It is concluded that the co-design of lightweight, telecom-specific large language models (Telecom-LLMs) and distributed inference mechanisms constitutes a pivotal evolutionary pathway toward realizing endogenous intelligence in future wireless communication systems.
Chunxuan Zhao· Applied and Computational En...· 0 citations