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 the Degrees-of-Freedom of the K-User Distributed Broadcast Channel
TL;DR: In this article, the authors studied the degree-of-freedom (DoF) in a wireless setting where each transmitter has access to its own multi-user imperfect channel estimate based on which it designs its transmit coefficients.
Proceedings ArticleDOI
Joint wireless information and energy transfer in cache-assisted relaying systems
TL;DR: This work investigates the performance of time switching based energy harvesting model for cache-assisted simultaneous wireless transmission of information and energy (Wi-TIE) and formulate based on the time-switching architecture an optimization problem to maximize the harvested energy.
Posted Content
Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K, 1/(K-1))
TL;DR: A new lower bound is derived which demonstrates the optimality of the proposed scheme for the demand where all the users request for distinct files.
Journal ArticleDOI
On the Effective Throughput of Coded Caching With Heterogeneous User Preferences: A Game Theoretic Perspective
TL;DR: It is shown that users with more concentrated preferences can obtain higher effective throughputs in a two-phase cache-aided network, in which users with heterogeneous preferences are served by a base station through a shared link.
Journal ArticleDOI
Stochastic Content-Centric Multicast Scheduling for Cache-Enabled Heterogeneous Cellular Networks
Bo Zhou,Ying Cui,Meixia Tao +2 more
TL;DR: In this paper, the authors studied the optimal content delivery in cache-enabled HetNets by taking into account the inherent multicast capability of wireless medium and proposed a stochastic content multicast scheduling to jointly minimize the average network delay and power costs under a multiple access constraint.
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.