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
Fundamental Limits of Distributed Data Shuffling
TL;DR: In this article, the authors considered a different communication paradigm referred to as distributed data shuffling, where workers, connected by a shared link, are allowed to communicate with one another while no communication between the master and workers is allowed.
Journal ArticleDOI
Modeling, Analysis, and Optimization of Caching in Multi-Antenna Small-Cell Networks
Xianzhe Xu,Meixia Tao +1 more
TL;DR: In this article, two types of beamforming are considered to improve the performance of collaborative content caching among multiple small base stations (SBSs), including probabilistic caching and coded caching.
Proceedings ArticleDOI
Adaptive Radio Unit Selection and Load Balancing in the Downlink of Fog Radio Access Network
Di Chen,Volker Kuehn +1 more
TL;DR: The design of green network at the system level is focused on, such that not only the transmission power, but also all additional operational power of active RUs (incl. power used for circuits, associated backhaul, etc.) is considered.
Journal ArticleDOI
Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Trade-Offs
TL;DR: Achievability arguments and lower bounds are leveraged to characterize the minimal NDT in a number of important special cases, as well as to prove that the proposed schemes achieve optimality within a constant multiplicative factor of 2 for all values of the problem parameters.
Posted Content
Physical-Layer Security in Cache-Enabled Cooperative Small Cell Networks Against Randomly Distributed Eavesdroppers
TL;DR: In this article, a joint design on the caching placement and the physical-layer transmission is proposed to improve the secure content delivery probability (SCDP) in a cooperative cache-enabled small base stations (SBSs) in the presence of randomly distributed eavesdroppers.
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.