Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching Networks
Yousef AlHassoun, Faisal Alotaibi, Aly El Gamal, Hesham El Gamal

TL;DR
This paper develops a comprehensive caching framework that jointly optimizes placement and delivery costs in wireless networks, revealing when coded caching outperforms uncoded strategies under realistic cost considerations.
Contribution
It introduces a general model accounting for costs in both placement and delivery phases, analyzing optimal caching strategies under various network architectures and constraints.
Findings
Uncoded caching can outperform coded caching in certain cost regions.
Coded caching benefits are significant only when placement and delivery architectures differ.
Optimal solutions depend on network cost parameters and memory constraints.
Abstract
Coded caching techniques have received significant attention lately due to their provable gains in reducing the cost of data delivery in wireless networks. These gains, however, have only been demonstrated under the assumption of a free placement phase. This unrealistic assumption poses a significant limitation, especially in cases where aggressive placement strategies can lead to a significant transmission cost that may even be higher than the corresponding cost of the delivery phase. In this paper, we relax this assumption and propose a general caching framework that captures the transmission cost of the two phases, and hence, results in minimizing the overall rate of the caching network. We model the dynamic nature of the network through a cost structure that allows for varying the network architecture and cost per transmission, across the placement and delivery phases. We start with…
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.
