2026· IEEE Transactions on Cognitive Communications and Networking· Vol 12, pp. 11462-11477· 0 citations· 34 references
Computer Science
Abstract
Deploying Large Language Models (LLMs) over the edge-cloud continuum faces severe stability challenges due to the conflict between stochastic network topology and complex workflow dependencies. Existing schedulers, relying either on computationally prohibitive Graph Neural Networks (GNNs) or topology-agnostic heuristics, fail to reconcile this tension. To bridge these gaps, we propose STEM, a service-level and topology-aware orchestration framework that formulates distributed LLM serving as a workflow-aware routing problem over a monitored service overlay, in which heterogeneous service instances act as specialized experts. At the core of STEM lies the STAR-PPO algorithm, utilizing a lightweight graph-free perception mechanism. By leveraging Squeeze-and-Excitation attention, it extracts critical bottleneck features from raw telemetry with linear complexity, bypassing the scalability limits of message-passing paradigms. To further achieve Pareto-efficient trade-offs, we develop a Dynamic Weight Adaptation (DWA) mechanism that autonomously recalibrates optimization preferences based on entropy-regularized metric drift. Extensive experiments on real-world datasets spanning 2,000 nodes demonstrate that our framework significantly outperforms state-of-the-art baselines. Specifically, STAR-PPO reduces network transmission costs by 96.8% and improves comprehensive inference efficiency by 24.4%, while sustaining robust zero-shot generalization across regions, with average latency within $1.09\times $ of a target-domain-retrained reference under a strict cross-region protocol. Code and data are available at https://github.com/gymorsiback/STARPPO
This paper employs five lightweight machine learning models to predict query-specific latency, accuracy, resource usage, and response size for each model-size-quantization-device combination, and design a lightweight heuristic that approximates the BILP solution.
Reza Farahani, Zoha Azimi, Mario Colosi et al.· 0 citations
Dyserve compiles each workflow's per-node model and verifier choices in one integer linear program (ILP) over a heterogeneous backend pool, priced by skill-conditioned offline profiles that transfer across workflows.
Jiayi Qian, Zishen Wan, Hanchen Yang et al.· 0 citations
O-DAG is presented, an end-to-end framework that closes the SAGA--simulation gap and evaluates five scheduling algorithms for a slice scheduling application across various configurations spanning 5K--50K UEs, 2--20 cells, and 2--10 network slices.
Y. Hwang, B. Krishnamachari· International Conference on...· 0 citations
Routing optimization in cloud-edge collaborative networks faces a fundamental conflict between global strategic planning and local real-time responsiveness, further complicated by structural heterogeneity and stochastic traffic patterns. Traditional protocols lack adaptivity, while existing Deep Reinforcement Learning...
Bin Dai, Yun-Tao Wang, Jianhai Zheng· IEEE Transactions on Network...· 0 citations
The fast development of Edge AI has moved the intelligence towards distributed Edge-Cloud computing infrastructure moving away from centralized cloud in terms of low-latency, privacy-preserving, and context-aware applications. However, the deployment and management of the AI-based workloads in heterogeneous and resourc...
Dragan Stojanović, N. Stojanović, Aleksandra Stojnev· International Scientific Con...· 0 citations
Edge computing is a promising paradigm for deploying latency-sensitive applications (Apps) as it brings resources closer to end users. Edge Apps often adopt a microservice (MS) architecture, breaking monolithic Apps into lightweight, containerized MSs that can be dynamically and independently deployed. However, managin...
Madhura Adeppady, Yenchia Yu, Ali Rahmanian et al.· IEEE Transactions on Network...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.