Hierarchical Coded Caching
Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas, Diggavi

TL;DR
This paper introduces a hierarchical coded caching scheme for two-layer networks, combining intra- and inter-layer multicasting to achieve near-optimal content delivery rates.
Contribution
It proposes a novel caching strategy that balances intra- and inter-layer coded multicasting, achieving near-optimal rates in hierarchical networks.
Findings
Achieves rates within a constant gap of the optimal
Balances multicasting opportunities within and across layers
Both layers operate near minimum rates simultaneously
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…
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.
Taxonomy
TopicsCaching and Content Delivery · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
