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
Posted Content
Cache Placement in Fog-RANs: From Centralized to Distributed Algorithms
TL;DR: In this article, the authors studied the cache placement problem in fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users, and developed both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints.
Posted Content
Coded Caching for Multi-level Popularity and Access
TL;DR: In this article, the authors derived an order-optimal scheme which judiciously shares cache memory among files with different popularities, and derived new information-theoretic lower bounds, which use a sliding-window entropy inequality.
Journal ArticleDOI
Joint Caching and Pricing Strategies for Popular Content in Information Centric Networks
TL;DR: In this article, the authors developed an analytical framework for distribution of popular content in an information centric network (ICN) that is comprised of access ICNs, a transit ICN, and a content provider.
Proceedings ArticleDOI
On the fundamental limits of caching in combination networks
Mingyue Ji,Ming Fai Wong,Antonia M. Tulino,Jaime Llorca,Giuseppe Caire,Michelle Effros,Michael Langberg +6 more
TL;DR: This paper studies a class of networks of increasing practical interest, namely, the combination caching networks, and shows that, in most parameter regimes, the achievable maximum link load is inversely proportional to the per-user storage capacity M and to the degree of each user r.
Proceedings ArticleDOI
Optimizing MDS Codes for Caching at the Edge
TL;DR: The results show that the careful placement of MDS-encoded content in caches at the wireless edge leads to a significant decrease of the load of the network backhaul and hence to a considerable performance enhancement of thenetwork.
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.