Skip to content

Latency-Aware Service Placement using Neural Combinatorial Optimisers for Edge-Cloud Systems

Jun 2026 · arXiv.org · Vol abs/2606.25553 · 0 citations · 45 references
Computer Science

TL;DR

Once trained, EP-NCO enables fast online inference, making it a practical solution for dynamic large-scale edge--cloud environments with hundreds of computing nodes, hosting thousands of applications, which is significantly beyond the capability of current scheduling systems.

Abstract

The growth of Internet of Things (IoT) applications and latency-sensitive services has increased the demand for efficient service placement across compute continuum platforms, such as edge--cloud systems. Modern applications are decomposed into interdependent microservices deployed over heterogeneous infrastructures, making placement under resource and network constraints an intractable NP-hard combinatorial optimisation problem. This study proposes a latency-aware Edge Placement Neural Combinatorial Optimiser (EP-NCO), a learning-based framework for service placement in compute continuum platforms. EP-NCO employs a dual-graph model to capture resource relationships and service dependencies within both computing infrastructure and application structure. Graph neural networks (GNNs) learn structural embeddings of infrastructure nodes and service components, whereas reinforcement learning policies construct feasible placements that account for execution latency, communication link delays, and bandwidth-sharing effects. Extensive simulations across multiple system scales demonstrate that EP-NCO consistently achieves high-quality placement decisions, reducing the total service response time by 46%--50% compared with metaheuristics (genetic algorithm and particle swarm optimisation) and by 25%--35% compared with controlled RL ablation baselines. Once trained, EP-NCO enables fast online inference, making it a practical solution for dynamic large-scale edge--cloud environments with hundreds of computing nodes, hosting thousands of applications, which is significantly beyond the capability of current scheduling systems.

View source

Similar papers

Jul 2026

Intelligent Placement of 5G Network Functions on Edge-Based Infrastructures

A constrained optimization model that supports different management goals through alternative objective functions (latency-aware or power-aware) while enforcing operational constraints, including node capacities, slice-specific latency bounds, and explicit limits on VNF migrations/relocations between scheduling periods...

R. Moreno-Vozmediano, E. Huedo, R. Montero et al. · 0 citations
Open access Aug 2026

Proximal Policy Optimization for Latency-Aware Service Function Chain Placement in Edge-Enabled Networks

This work proposes an enhanced Proximal Policy Optimization (PPO) framework for resource-aware and latency-sensitive SFC placement in edge-enabled networks, and demonstrates the applicability of the proposed framework in mission-critical and latency-sensitive service environments.

Nithin Melala Eshwarappa, Ching-Hsien Hsu, Hojjat Baghban et al. · 0 citations
Preprint Jul 2026

LMEdge: QoS-Aware LLM Inference Orchestration on Edge Clusters

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
2026

Efficient Management of Composite Heterogeneous Applications at the Network Edge

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. · 0 citations
Open access Jul 2026

Task-Offloading Optimization in Mobile Edge Computing for Smart Library Services

A preference-adaptive dueling double deep Q-network algorithm, termed PA-DDQN, is proposed by integrating preference conditioning, multi-head attention, a dueling architecture, and double Q-learning, demonstrating its effectiveness in enhancing service responsiveness, energy efficiency, and reliability in smart library...

Jingjing Qu, Peiying Zhang, Ruixin Wang et al. · 0 citations
#edge computing Sep 2026

CHIME: Cost-Constrained Hybrid Popularity-Aware Intelligent Service Caching Framework for MEC

Mobile edge computing (MEC) has emerged as a promising paradigm to support latency-sensitive applications by deploying computing and storage resources closer to end users. Service caching at the network edge is an effective approach to further reduce response latency and improve quality of service (QoS). However, the i...

Tianyang Zheng, Pengfei Yang, Kang Shen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.