Search arXivSearch

arXiv subjects

Reza Farahani

Publications and source records attributed to Reza Farahani.

2 recordsLinked to original sources

DRLM: Deep Reinforcement Learning-Based LLM Query Orchestration in Edge Environments

Large language model (LLM) services increasingly process heterogeneous queries with diverse latency, accuracy, and resource requirements. While edge deployment reduces response time, the heterogeneity of devices and the diversity of model families, parameter scales, and quantization levels make efficient LLM query orchestration challenging. This paper introduces DRLM, a Deep Reinforcement Learning-based LLM query orchestration framework in edge environments. DRLM integrates two lightweight predictors: (i) a class-conditioned quality estimator that maps queries to semantic categories and infers model performance, and (ii) a feature-driven latency predictor that estimates inference time across model-device configurations. These predictions, combined with system state, feed a factorized Proximal Policy Optimization (PPO) agent that performs state-aware orchestration decisions. To enable data-driven orchestration, we construct a large-scale benchmarking dataset with 223 835 measurements spanning 1258 queries, 6 query classes, 8 model families (32 deployed instances), 5 quantization levels, and heterogeneous edge devices. Evaluation on a 64-node edge cluster and comparison with three baselines and two state-of-the-art methods show that DRLM reduces inference latency by up to 51% and queuing delay by up to 67 %, while incurring at most 8% accuracy loss. It improves latency under increasing workloads up to 61.4%, demonstrating robust and stable orchestration.

cs.DC

Real-Time AI Service Economy: A Framework for Agentic Computing Across the Continuum

Real-time AI services run across the device-edge-cloud continuum, where autonomous AI agents generate latency-sensitive workloads, orchestrate multi-stage pipelines, and compete for shared resources under governance constraints. This article shows that the structure of service-dependency graphs, modelled as DAGs of compute stages, is a primary determinant of whether decentralised, price-based resource allocation works reliably at scale. When dependency graphs are hierarchical (tree or series-parallel), prices converge to stable equilibria, optimal allocations are computed efficiently, and under appropriate mechanism design agents have no incentive to misreport their valuations within each decision epoch; when dependencies are more complex, prices oscillate and allocation quality degrades. Our anchor contribution is a hybrid architecture in which cross-domain integrators encapsulate complex sub-graphs into slices with a simpler interface, carrying a feasibility-and-DSIC guarantee and a price-stability property of the integrator's price-discovery dynamics. An ablation study across six experiments (1,590 runs, 10 seeds each), with a strategic-bidding test of incentive compatibility and a measured agentic workload, confirms that (i) topology is a first-order determinant of price stability and scalability, (ii) in the contended regime the integrator's EMA-smoothed slice posting robustly reduces agent-facing price volatility (median ~89%) and mitigates governance-induced volatility, (iii) governance constraints create quantifiable efficiency-compliance trade-offs depending on topology and load, and (iv) under truthful bidding the market matches a centralised value-greedy baseline, adding modest welfare under contention. Systems whose pipelines form hierarchical DAGs can thus achieve centralised-quality coordination through decentralised pricing without a single controlling authority.

cs.AI