Aug 2026· 2026 IEEE/CIC International Conference on Communications in China (ICCC)· pp. 93-98· 0 citations· 16 references
Abstract
In edge caching systems, maintaining content freshness is critical for optimizing user experience, especially under dynamic content popularity. This paper proposes a novel Dynamic Cache Update Algorithm (DCUA) that leverages Age of Information (AoI) as a performance metric to optimize cache updates. To address the challenge that the content popularity changes over time which is modeled as a finite-state Markov chain, AoI minimization problem is formulated as a Markov decision process (MDP). By carefully designing the state-dependent features and reward, DCUA integrates Proximal Policy Optimization (PPO) to learn the cache update policy. By employing Exponential Moving Averages (EMA) to track shifting popularity trends, DCUA adapts the cache update frequency to match the dynamic peaks and troughs of user demands. Numerical simulation results demonstrate that DCUA consistently achieves superior cache freshness and robust convergence compared with baseline strategies by accurately capturing temporal popularity trends across diverse dynamic scenarios.
: Edge caching is a key technology for improving video transmission efficiency, but traditional cache replacement strategies struggle to adapt to dynamic network environments and heterogeneous user requests. To address this issue, a novel cache replacement framework named Edge Cache Replacement Strategy based on Trust...
Yuan Feng, Jia-Hao Ying, Ya-Hui Sun et al.· Computers, Materials & C...· 0 citations
We consider an edge caching system with a finite capacity edge-cache connected to a backend server via a wireless channel. The backend server stores the latest versions of dynamic contents. Users request the edge server for the contents, which can either fetch fresh versions from backend and serve or can serve locally...
Ankita Koley, Chandramani Singh· ACM Transactions on Modeling...· 0 citations
Modern web applications demand sustained low latency under workloads that shift across users, devices, sessions, and network conditions. Classical cache replacement policies such as Least Recently Used (LRU) and Least Frequently Used (LFU) treat every cached object identically and ignore the cost-of-miss heterogeneity...
Akshatha Madapura Anantharamu· World Journal of Advanced En...· 0 citations
Existing research on Content Delivery Networks (CDNs) predominantly focuses on optimizing the delivery of hot content—popular items that attract frequent and repeated access from large user bases. However, at Meta, we have identified that cold content, which is less popular and accessed infrequently, poses significant...
Tiansheng Zhang, YuLing Chen, Ahmed Kamal et al.· Conference on Applications,...· 0 citations
Learning-augmented online algorithms use predictions to improve performance beyond worst-case guarantees while preserving robustness to prediction errors. In caching, existing approaches typically rely on signals such as next-arrival times or ranking scores, whose quality is measured through aggregate or worst-case err...
Helia Karisani, Mohammadreza Daneshvaramoli, Adam Lechowicz et al.· ACM SIGMETRICS Performance E...· 0 citations
In recent years, the rapid development of short-video platforms has led to a surge in network traffic generated by mobile devices. The frequent changes in user location pose significant challenges to the continuity and smoothness of video content services. To address the decline in service quality caused by user mobili...