Hierarchical Coded Caching
From MaRDI portal
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.
Recommendations
- Coded Caching With Distributed Storage
- Coded Caching for Multi-level Popularity and Access
- Optimization of Heterogeneous Coded Caching
- Online hierarchical cooperative caching
- Multi-Server Coded Caching
- Improved Lower Bounds for Coded Caching
- scientific article; zbMATH DE number 1305451
- Placement algorithms for hierarchical cooperative caching
- Coded Caching and Content Delivery With Heterogeneous Distortion Requirements
- Coded Caching With Nonuniform Demands
This page was built for publication: Hierarchical Coded Caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976772)
