Hierarchical Coded Caching

Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi

Research output: Contribution to journalArticlepeer-review

207 Scopus citations

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 locally deliver the part of the content, 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 paper, 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 the layers can simultaneously operate at approximately the minimum rate.

Original languageEnglish (US)
Article number7458151
Pages (from-to)3212-3229
Number of pages18
JournalIEEE Transactions on Information Theory
Volume62
Issue number6
DOIs
StatePublished - Jun 2016
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

  • Caching
  • cache hierarchies
  • content distribution
  • hierarchical systems

Fingerprint

Dive into the research topics of 'Hierarchical Coded Caching'. Together they form a unique fingerprint.

Cite this