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
Proceedings ArticleDOI
D2D Assisted Beamforming for Coded Caching
TL;DR: In this article, a D2D aided beamforming for coded caching is considered in a finite signal-to-noise ratio regime, where the local cache content exchange among nearby users is exploited.
Journal ArticleDOI
Multi-Antenna Coded Caching From a Placement Delivery Array for Shared Caches
Elizabath Peter,B. Sundar Rajan +1 more
TL;DR: This work proposes a procedure to obtain new coded caching schemes for shared caches with reduced sub-packetization levels than the known schemes in both single and multi-antenna settings, and recovers the optimal caching schemes given by Parinello et al.
Journal ArticleDOI
On the Optimal Memory-Load Tradeoff of Coded Caching for Location-Based Content
TL;DR: In this article , the authors considered the coded caching problem for location-based content with edge cache nodes, where each user only requests a file from a location-dependent subset of the library and the objective is to minimize the worstcase load (i.e., the worst-case number of broadcasted bits from the content server among all possible demands).
Journal ArticleDOI
Exploiting the Logic-In-Memory paradigm for speeding-up data-intensive algorithms
Mario Cofano,Marco Vacca,Giulia Santoro,Giovanni Causapruno,Giovanna Turvani,Mariagrazia Graziano +5 more
TL;DR: This work presents an architectural implementation of the Logic-In-Memory (LIM) concept that is characterized by considering three data-intensive benchmarks: the odd even sort, the integral image and the binomial filter, showing an impressive increase in performance, in terms of speed gain and power consumption reduction.
Posted Content
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands
TL;DR: This work analytically characterize the optimal placement strategy that minimizes the expected delivery rate under a storage capacity constraint and derives a polynomial time algorithm that determines the base-cases of the problem given the number of caches and popularity distribution of files.
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.