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
An Intelligent Caching Strategy Considering Time-Space Characteristics in Vehicular Named Data Networks
TL;DR: Experimental results from NDNSim platform show that the designed scheme has an approximately 50% performance enhancement compared with Leave Copy Everywhere (LCE), Pro(0.7), and Pro( 0.2) data caching protocols in terms of average hit rate, average hop count and average cache replacement times, which verifies the reliability and effectiveness of the proposed data caching scheme.
Journal ArticleDOI
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
TL;DR: In this paper, the authors proposed two new centralized coded caching schemes with low subpacketization and moderate rate gains utilizing projective geometries over finite fields, which achieve the same asymptotic subpacketsization, which is exponential in O((log {K})^{2})$ for some positive integer r and K being the number of users.
Journal ArticleDOI
A Rate–Distortion Approach to Index Coding
Sinem Unal,Aaron B. Wagner +1 more
TL;DR: In this paper, the authors considered index coding as a special case of rate-distortion with multiple receivers, each with some side information about the source, and provided two upper bounds and one lower bound on the optimal index coding rate.
Proceedings ArticleDOI
PIR from Storage Constrained Databases - Coded Caching Meets PIR
TL;DR: The main contribution of this work is a general achievable scheme for PIR from storage constrained databases for any value of storage that can strictly outperform memory-sharing between extreme values of storage.
Journal ArticleDOI
Joint Pricing and Cache Placement for Video Caching: A Game Theoretic Approach
TL;DR: Simulation results show that the proposed joint optimization formulation follows the law of demand in economics, and the proposed algorithms for both cases can efficiently converge to the SE point that jointly maximizes the profit for both the VP and the MNO.
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.