Published May 1, 2018
| Version v1
Journal article
Open
Fundamental limits of caching: Improved rate-memory trade-off with coded prefetching
Description
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 proposed scheme outperforms the best rate-memory region known in the literature if N ≤ K ≤ ((N 2 + 1)/2).
Notes
Grant numbers : This work was supported in part by the Catalan Government under Grant SGR2017-1479, and in part by the Spanish Government under Grant TEC2013-44591-P (INTENSYV). © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Files
Fundamental limits of caching_Improved rate.pdf
Files
(589.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a1ab78ce5976fdaeff365571e288fc80
|
589.9 kB | Preview Download |