Hierarchical Coded Caching
arXiv:1403.7007
Abstract
Caching of popular content during off-peak hours is a strategy to reduce network loads during peak hours. Recent work has shown significant benefits of designing such caching strategies not only to deliver part of the content locally, but also to provide coded multicasting opportunities even among users with different demands. Exploiting both of these gains was shown to be approximately optimal for caching systems with a single layer of caches. Motivated by practical scenarios, we consider in this work a hierarchical content delivery network with two layers of caches. We propose a new caching scheme that combines two basic approaches. The first approach provides coded multicasting opportunities within each layer; the second approach provides coded multicasting opportunities across multiple layers. By striking the right balance between these two approaches, we show that the proposed scheme achieves the optimal communication rates to within a constant multiplicative and additive gap. We further show that there is no tension between the rates in each of the two layers up to the aforementioned gap. Thus, both layers can simultaneously operate at approximately the minimum rate.
31 pages
References in corpus (2)
Cited by in corpus (22)
- Speeding Up Distributed Machine Learning Using Codes
- Placement Delivery Array Design through Strong Edge Coloring of Bipartite Graphs
- Order-Optimal Rate of Caching and Coded Multicasting with Random Demands
- Wireless Multihop Device-to-Device Caching Networks
- Coded Caching Schemes with Low Rate and Subpacketizations
- A Fundamental Tradeoff between Computation and Communication in Distributed Computing
- Information Theoretic Caching: The Multi-User Case
- Caching and Delivery via Interference Elimination
- Wireless Coded Caching: A Topological Perspective
- On the Gap Between Decentralized and Centralized Coded Caching Schemes
- Improved Lower Bounds for Coded Caching
- The Optimal Placement Delivery Arrays
- Constructions of Coded Caching Schemes with Flexible Memory Size
- On Secure Coded Caching via Combinatorial Method
- Linear Coded Caching Scheme for Centralized Networks
- Sprout: A functional caching approach to minimize service latency in erasure-coded storage
- Cache Placement in Fog-RANs: From Centralized to Distributed Algorithms
- A Novel Recursive Construction for Coded Caching Schemes
- Cache-Aided Content Delivery over Erasure Broadcast Channels
- Optimal Caching Placement for D2D Assisted Wireless Caching Networks
- Content Delivery in Erasure Broadcast Channels with Cache and Feedback
- Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks