Hierarchical Coded Caching
Reads0
Chats0
TLDR
A new caching scheme that combines two basic approaches to provide coded multicasting opportunities within each layer and across multiple layers is proposed, which achieves the optimal communication rates to within a constant multiplicative and additive gap.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.read more
Citations
More filters
Journal ArticleDOI
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
TL;DR: A novel caching scheme is proposed, which strictly improves the state of the art by exploiting commonality among user demands and fully characterize the rate-memory tradeoff for a decentralized setting, in which users fill out their cache content without any coordination.
Posted Content
Hierarchical Coded Caching
TL;DR: A new caching scheme that combines two basic approaches is proposed that achieves the optimal communication rates to within a constant multiplicative and additive gap and shows that there is no tension between the rates in each of the two layers up to the aforementioned gap.
Journal ArticleDOI
A Survey of Caching Techniques in Cellular Networks: Research Issues and Challenges in Content Placement and Delivery Strategies
TL;DR: A systematical survey of the state-of-the-art caching techniques that were recently developed in cellular networks, including macro-cellular networks, heterogeneous networks, device-to-device networks, cloud-radio access networks, and fog-radioaccess networks.
Journal ArticleDOI
Order-Optimal Rate of Caching and Coded Multicasting With Random Demands
TL;DR: In this article, the authors considered the canonical shared link caching network and provided a comprehensive characterization of the order-optimal rate for all regimes of the system parameters, as well as an explicit placement and delivery scheme achieving orderoptimal rates.
Journal ArticleDOI
Coded Caching Under Arbitrary Popularity Distributions
TL;DR: This work first derives a new information-theoretical lower bound on the expected transmission rate of any coded caching schemes, and shows that a simple coded-caching scheme attains an expected Transmission rate that is at most a constant factor away from the lower bound.
References
More filters
Proceedings ArticleDOI
Web caching and Zipf-like distributions: evidence and implications
TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
Journal ArticleDOI
Fundamental Limits of Caching
TL;DR: This paper proposes a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared with previously known schemes, and argues that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.
Proceedings ArticleDOI
FemtoCaching: Wireless video content delivery through distributed caching helpers
Negin Golrezaei,Karthikeyan Shanmugam,Alexandros G. Dimakis,Andreas F. Molisch,Giuseppe Caire +4 more
TL;DR: The theoretical contribution of this paper lies in formalizing the distributed caching problem, showing that this problem is NP-hard, and presenting approximation algorithms that lie within a constant factor of the theoretical optimum.
ReportDOI
A hierarchical internet object cache
TL;DR: The design and performance of a hierarchical proxy-cache designed to make Internet information systems scale better are discussed, and performance measurements indicate that hierarchy does not measurably increase access latency.
Journal ArticleDOI
Decentralized coded caching attains order-optimal memory-rate tradeoff
TL;DR: In this paper, the authors propose an efficient caching scheme, in which the content placement is performed in a decentralized manner, and despite this lack of coordination, the proposed scheme is nevertheless able to create coded-multicasting opportunities and achieves a rate close to the optimal centralized scheme.