Skip to content

Joint Service Caching and Resource Allocation in DT-Empowered Cloud-Edge Networks via MARL With Hierarchical Knowledge Transfer

Oct 2026 · IEEE Transactions on Mobile Computing · Vol 25, pp. 17243-17261 · 1 citation · 39 references

Abstract

Through bypassing the long-distance transmission of cloud services, Mobile Edge Computing (MEC) reduces response delay and ensures Quality-of-Service (QoS). In resource-constrained MEC, due to the strong coupling between service provisioning and task execution, reasonable service caching and resource allocation face many challenges on 1) coordinating the limited storage resources to improve cache hit rate, 2) allocating limited computing resources under delay constraints, and 3) sample collection and model training in dynamic environments. To address these important challenges, we propose CAMART, a novel service Caching and resource Allocation framework via Multi-Agent Reinforcement learning (MARL) with hierarchical knowledge Transfer in Digital Twin (DT) empowered Cloud-Edge Networks (DTCEN). Specifically, we first construct a new DTCEN to realize the mapping from physical to virtual networks. Next, we decouple the joint optimization of service caching and resource allocation into two sub-problems. For the service caching sub-problem, we design an improved MARL-based method to capture global information via a shared-feature extraction network and optimize caching and offloading decisions via a dual-head feature processing network. For the resource allocation sub-problem, we convert it into 0-1 integer programming and design an improved branch-and-bound-based method to reduce computational complexity while guaranteeing a high-quality solution set. Finally, we develop an original DT-driven hierarchical knowledge transfer mechanism to realize cross-scenario knowledge reuse and convergence acceleration. Using real-world datasets, extensive experiments are conducted to validate the superiority of the proposed CAMART. Compared to the state-of-the-art methods, CAMART achieves higher rewards, task completion rate, and cache hit rate in different scenarios.

View source

Similar papers

Open access Sep 2026

Dynamic Scheduling Algorithm for Edge-cloud Collaborative Computing Resources Based on 5G NR-U and Distributed Large Model

The proposed MADDPG algorithm outperforms benchmark algorithms such as CO (Cloud-Only), GO (Greedy Offloading), SEP (Static Expert Partitioning), DDPG (Deep Deterministic Policy Gradient), COMA (Counterfactual Multi-Agent Policy Gradients), and MAPPO (Multi-Agent Proximal Policy Optimization) in terms of average iterat...

De-Feng Duan, Hong Liu, Li-Yu Huang et al. · 0 citations
#edge computing Nov 2026

Collaborative Large Model Caching and Inference Offloading With Parameter Sharing in MEC

Pretrained Foundation Models (PFMs) enable highaccuracy inference services but are typically deployed in remote datacenters, resulting in prohibitively high inference delay. Mobile Edge Computing (MEC) can mitigate such high delays by caching PFMs or their fine-tuned variants on cloudlets located close to end users. Ho...

Li-Zhe Zhou, Qiu-Fen Xia, Zi-Chuan Xu et al. · 0 citations
Preprint Aug 2026

Data-Driven Online Slice Admission Control and Resource Allocation in NextG Mobile Networks

This work introduces Online Pricing-based Slice Admission Control and Resource Allocation (OPA) framework, which dynamically assigns pseudo-prices to resources that capture long-term scarcity and anticipated inter-temporal opportunity costs and designs an exponential pricing strategy that guarantees bounded worst-case...

Muhammad Sulaiman, Bo Sun, M. A. Salahuddin 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
Conference Aug 2026

Symbiotic Value Capacity Optimization in Satellite-Terrestrial Integrated Communication and Computing Networks

Satellite-terrestrial integrated communication and computing network (STICCN) faces the core challenge of supporting highly heterogeneous tasks with differentiated requirements, under stringent dual constraints of communication and computing resources. Most existing scheduling schemes focus on macroscopic system perfor...

Tian-Qi Ye, Ya-Qiong Liu, Shi-Jie Zhang · 0 citations
2026

Traffic Prediction-Assisted Resource Allocation for RAN Slicing Enabling URLLC and eMBB Coexistence

The coexistence of Ultra-Reliable Low-Latency Communication (URLLC) and Enhanced Mobile Broadband (eMBB) can simultaneously meet the reliability and real-time performance requirements of critical services as well as the requirements of high-bandwidth services. In 5G and beyond 5G (B5G) networks, radio access network (R...

Yixuan Bai, Heng Wang · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

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