Fundamental Limits of Caching
نویسندگان
چکیده
منابع مشابه
Fundamental Limits of Caching: Improved Bounds For Small Buffer Users
In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coinc...
متن کاملA Note on the Fundamental Limits of Coded Caching
The fundamental limit of coded caching is investigated for the case with N = 3 files and K = 3 users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
متن کاملFundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملFundamental Limits of Caching: Improved Delivery Rate-Cache Capacity Trade-off
We consider a centralized coded caching system consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link. Each user is equipped with a local cache of capacity MF bits. The contents can be proactively cached into the user caches by the server over low traffic period; however, without the knowledge of the user demands. During the peak tra...
متن کاملSpectrum Sensing: Fundamental Limits
Cognitive radio systems need to be able to robustly sense spectrum holes if they want to use spectrum opportunistically. However, this problem is more subtle than it first appears. It turns out that real-world uncertainties make it impossible to guarantee both robustness and high-sensitivity to a spectrum sensor. A traditional time-domain perspective on this is relatively straightforward, but t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2306938