Sep 2026· IEEE Internet of Things Journal· Vol 13, pp. 40830-40845· 0 citations· 37 references
Computer Science
Abstract
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 increasing scale and dynamic nature of user requests pose significant challenges to efficient service caching and updating under limited edge resources and cost budgets. In this article, we investigate the joint optimization problem of service caching and dynamic updating in a cloud–edge–end collaborative architecture, with the objective of minimizing the average service access latency of users. We first construct a comprehensive system model that captures communication latency, service response delay, and the costs associated with service caching and updates. The problem is formulated as a nonlinear integer programming problem and addressed via a two-stage solution framework. Specifically, in the initial caching stage, we employ Lagrangian relaxation to reduce the high-dimensional knapsack problem and design an efficient algorithm integrated with Tabu Search. In the dynamic updating stage, we develop a Monte Carlo tree search (MCTS)-based algorithm enhanced by service popularity awareness, along with a novel service replacement strategy that considers user preference and service reliability. Extensive experiments under various system scales demonstrate that the proposed approach significantly outperforms state-of-the-art methods in terms of average service latency, cost budget satisfaction, and update efficiency.
An adaptive Beta-policy and delayed-update multi-agent soft actor-critic method, abbreviated as ABDMASAC, which uses a Beta policy to model bounded actions and achieves a better overall trade-off than the selected MASAC-backbone and on-policy MARL baselines under the considered simulation settings.
Zheng Yao, Jie Liu, Changjun Deng et al.· Computers, Materials & C...· 0 citations
This work frames the edge caching problem as a restless multiarmed bandit (RMAB), shows that it is indexable, and designs a Whittle index based joint policy for content fetching, caching and delivery that performs very close to optimal.
Ankita Koley, Chandramani Singh· ACM Transactions on Modeling...· 0 citations
A distributed game-theoretic framework for joint task offloading and service caching in STINs, providing provable equilibrium guarantees is developed, formulated as a non-cooperative stochastic game among IoT devices that autonomously determine their computing, association, and satellite caching strategies.
Filothei Linardatou, Maria Diamanti, E. Tsiropoulou et al.· IEEE Open Journal of the Com...· 0 citations
Simulation results confirm that the proposed JORC framework substantially reduces latency, energy consumption, and overall system cost, while increasing the successful task completion ratio compared to existing baseline approaches.
Tanmay Baidya, Sangman Moh· Italian National Conference...· 0 citations
To address the problems of limited caching resources at edge nodes, dynamically changing user requests, and imbalanced node loads in mobile edge computing, this paper proposes a hedonic-game-based cooperative caching optimization strategy (HG-CC). First, a joint utility function integrating caching benefit and cooperat...
Ting Wang, Jun Zhang, Ruoheng Chen· 2026 8th International Confe...· 0 citations
Numerical simulations demonstrate that proactive caching based on clustered-BSVM outperforms existing methods in terms of CHR and USR, while the branch-and-bound method effectively resolves the content delivery problem, minimizing system latency.
Ayaz Ahmad, Fawad Ahmad, Muhammad Suleman Khan et al.· PeerJ Computer Science· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026
Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity. The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.