Fundamental Limits of Caching
TLDR
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.Abstract:
Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through the network. The gain offered by this approach, which we term local caching gain, depends on the local cache size (i.e., the memory available at each individual user). In this paper, we introduce and exploit a second, global, caching gain not utilized by conventional caching schemes. This gain depends on the aggregate global cache size (i.e., the cumulative memory available at all users), even though there is no cooperation among the users. To evaluate and isolate these two gains, we introduce an information-theoretic formulation of the caching problem focusing on its basic structure. For this setting, we propose 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. In particular, the improvement can be on the order of the number of users in the network. In addition, we argue that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.read more
Citations
More filters
Journal ArticleDOI
On Coded Caching With Private Demands
Kai Wan,Giuseppe Caire +1 more
TL;DR: This paper designs a two-phase private caching scheme with minimum load while preserving the information-theoretic privacy of the demands of each user with respect to other users, and introduces a number of virtual users for the virtual-user scheme.
Proceedings ArticleDOI
Cache-aided coded multicast for correlated sources
TL;DR: In this article, a correlation-aware coded multicast problem is generalized to account for the correlation among the network content by formulating a source compression problem with distributed side information and an upper bound on its performance is derived.
Proceedings ArticleDOI
Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study
Fan Xu,Kangqi Liu,Meixia Tao +2 more
TL;DR: This paper designs the delivery phase carefully to turn the considered interference channel opportunistically into broadcast channel, multicast channel, X channel, or a hybrid form of these channels, and obtains an achievable upper bound of the minimum FDT by solving a linear programming problem of the file splitting ratios.
Proceedings ArticleDOI
Distributed storage in the plane
TL;DR: In this paper, the expected cost of obtaining the complete data under uncoded as well as coded data allocation strategies is compared. And the results are validated by computing the costs of the allocation strategies for the case that storage devices coincide with currently deployed mobile base stations.
Proceedings ArticleDOI
Content delivery with coded caching and massive MIMO in 5G
TL;DR: It is shown that in this setting MIMO and coded caching are indeed complementary and the combination of both provides a scalable solution in most practical scenarios.
References
More filters
Journal ArticleDOI
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Journal ArticleDOI
Amortized efficiency of list update and paging rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
Proceedings ArticleDOI
Distributed Caching Algorithms for Content Distribution Networks
TL;DR: This paper develops light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost, and establishes that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance.
Journal ArticleDOI
Index Coding With Side Information
TL;DR: A measure on graphs, the minrank, is identified, which exactly characterizes the minimum length of linear and certain types of nonlinear INDEX codes and for natural classes of side information graphs, including directed acyclic graphs, perfect graphs, odd holes, and odd anti-holes, minrank is the optimal length of arbitrary INDex codes.
Journal ArticleDOI
Comparative Models of the File Assignment Problem
TL;DR: This perspective exposes the further research which is necessary in order to provide a truly satisfactory solution to the file assignment problem.