Distributed Reinforcement Learning for Privacy-Preserving Dynamic Edge Caching
Shengheng Liu, Chong Zheng, Yongming Huang, Tony Q. S. Quek

TL;DR
This paper introduces a privacy-preserving distributed reinforcement learning algorithm to optimize edge caching in mobile edge computing, effectively handling dynamic content popularity and enhancing cache hit rates without compromising user privacy.
Contribution
It proposes a novel P2D3PG algorithm combining federated learning and distributed reinforcement learning for privacy-aware cache optimization in MEC networks.
Findings
Significantly improves cache hit rates compared to baseline methods.
Effectively preserves user privacy during cache optimization.
Handles dynamic and unobservable content popularities.
Abstract
Mobile edge computing (MEC) is a prominent computing paradigm which expands the application fields of wireless communication. Due to the limitation of the capacities of user equipments and MEC servers, edge caching (EC) optimization is crucial to the effective utilization of the caching resources in MEC-enabled wireless networks. However, the dynamics and complexities of content popularities over space and time as well as the privacy preservation of users pose significant challenges to EC optimization. In this paper, a privacy-preserving distributed deep deterministic policy gradient (P2D3PG) algorithm is proposed to maximize the cache hit rates of devices in the MEC networks. Specifically, we consider the fact that content popularities are dynamic, complicated and unobservable, and formulate the maximization of cache hit rates on devices as distributed problems under the constraints of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
