.png){kind=icon}
.png){kind=icon}
Return
Edge Caching Optimization With PPO and Transfer Learning for Dynamic Environments
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2025.3577904.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses the challenge of edge caching in dynamic environments, where rising traffic loads strain backhaul links and core networks. We propose a proximal policy optimization (PPO)-based caching strategy that fully incorporates key file attributes, such as size, lifetime, importance, and popularity, while also considering random file request arrivals, reflecting more realistic edge caching scenarios. In dynamic environments, changes, such as shifts in content popularity and variations in request rates frequently occur, making previously learned policies less effective as they were optimized for earlier conditions. Without adaptation, caching efficiency and response times can degrade. While learning a new policy from scratch in a new environment is an option, it is highly inefficient and computationally expensive. Thus, adapting an existing policy to these changes is critical. To address this, we develop a mechanism that detects changes in content popularity and request rates, ensuring timely adjustments to the caching strategy. We also propose a transfer learning-based PPO algorithm that accelerates convergence in new environments by leveraging prior knowledge. Simulation results demonstrate the significant effectiveness of our approach, outperforming a recent deep reinforcement learning (DRL)-based method.
Keywords:
Change detection
edge caching
proximal policy optimization (PPO)
semi-Markov decision process (MDP)
transfer learning