Deep Learning for Wireless Coded Caching with Unknown and Time-Variant Content Popularity
Not on the map. Why?
Abstract (arXiv)
Coded caching is effective in leveraging the accumulated storage size in wireless networks by distributing different coded segments of each file in multiple cache nodes. This paper aims to find a wireless coded caching policy to minimize the total discounted network cost, which involves both transmission delay and cache replacement cost, using tools from deep learning. The problem is known to be challenging due to the unknown, time-variant content popularity as well as the continuous, high-dimensional action space. We first propose a clustering based long short-term memory (C-LTSM) approach to predict the number of content requests using historical request information. This approach exploits the correlation of the historical request information between different files through clustering. Based on the predicted results, we then propose a supervised deep deterministic policy gradient (SDDPG) approach. This approach, on one hand, can learn the caching policy in continuous action space by using the actor-critic architecture. On the other hand, it accelerates the learning process by pre-training the actor network based on the solution of an approximate problem that minimizes the per-slot cost. Real-world trace-based numerical results show that the proposed prediction and caching policy using deep learning outperform the considered existing methods.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 1.
6 papers.
- 2021TEDGE-Caching: Transformer-based Edge Caching Towards 6G Networkscited by 7
- 2022Multi-Content Time-Series Popularity Prediction with Multiple-Model Transformers in MEC Networkscited by 4
- 2022ViT-CAT: Parallel Vision Transformers with Cross Attention Fusion for Popularity Prediction in MEC Networkscited by 1
- 2023Semantics-enhanced Temporal Graph Networks for Content Popularity Predictioncited by 1
- 2024Edge Caching Optimization with PPO and Transfer Learning for Dynamic Environmentscited by 1
- 2023CLSA: Contrastive Learning-based Survival Analysis for Popularity Prediction in MEC Networkscited by 0
- 2024Edge Caching Optimization with PPO and Transfer Learning for Dynamic Environments14 Nov 2024
- 2023CLSA: Contrastive Learning-based Survival Analysis for Popularity Prediction in MEC Networks21 Mar 2023
- 2023Semantics-enhanced Temporal Graph Networks for Content Popularity Prediction29 Jan 2023
- 2022ViT-CAT: Parallel Vision Transformers with Cross Attention Fusion for Popularity Prediction in MEC Networks27 Oct 2022
- 2022Multi-Content Time-Series Popularity Prediction with Multiple-Model Transformers in MEC Networks12 Oct 2022
- 2021TEDGE-Caching: Transformer-based Edge Caching Towards 6G Networks1 Dec 2021