Adaptive Edge Caching in Dynamic Environments Using PPO and Transfer Learning

This study tackles the problem of edge caching within dynamic settings, where increasing traffic demands put pressure on backhaul links and core network infrastructures. We introduce a caching method based on Proximal Policy Optimization (PPO) that integrates essential file characteristics, including size, lifetime, importance, and popularity, while also accommodating random file request patterns to better mirror real-world edge caching situations. Dynamic environments often experience fluctuations in content popularity and request rates, rendering previously established policies less effective since they were tailored to earlier conditions. Although training a new policy from scratch in a changed environment is feasible, it is often inefficient and resource-intensive. To solve this issue, we present a PPO algorithm enhanced with transfer learning, which improves convergence in new environments by utilizing previously acquired knowledge. Our simulation results highlight the substantial advantages of our approach, outperforming recent transfer learning-based methods in terms of convergence rate, demonstrating its potential to enhance edge caching in dynamic real-world scenarios.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161006
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Edge Caching in Dynamic Environments Using PPO and Transfer Learning

Farnaz Niknia, Ping Wang
Caching and Content Delivery
article

Adaptive Edge Caching in Dynamic Environments Using PPO and Transfer Learning

Farnaz Niknia, Ping Wang
article en

Abstract

This study tackles the problem of edge caching within dynamic settings, where increasing traffic demands put pressure on backhaul links and core network infrastructures. We introduce a caching method based on Proximal Policy Optimization (PPO) that integrates essential file characteristics, including size, lifetime, importance, and popularity, while also accommodating random file request patterns to better mirror real-world edge caching situations. Dynamic environments often experience fluctuations in content popularity and request rates, rendering previously established policies less effective since they were tailored to earlier conditions. Although training a new policy from scratch in a changed environment is feasible, it is often inefficient and resource-intensive. To solve this issue, we present a PPO algorithm enhanced with transfer learning, which improves convergence in new environments by utilizing previously acquired knowledge. Our simulation results highlight the substantial advantages of our approach, outperforming recent transfer learning-based methods in terms of convergence rate, demonstrating its potential to enhance edge caching in dynamic real-world scenarios.

York University (CA)
Openalex Percentile: Top 69%
Caching and Content Delivery
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.