Fundamental limits of caching: Improved rate-memory tradeoff 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 scen...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | España |
| Institución: | Centre Tecnològic de Telecomunicacions de Catalunya (CTTC) |
| Repositorio: | r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC) |
| OAI Identifier: | oai:cttc.fundanetsuite.com:p1529 |
| Acceso en línea: | https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1529 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046794890&doi=10.1109%2fTCOMM.2018.2834364&partnerID=40&md5=1918652d9424cc1811ae5f62ac293f80 |
| Access Level: | acceso abierto |
| Palabra clave: | Buffer storage Codes (symbols) Economic and social effects Encoding (symbols) Network coding Servers Cache capacity Cache networks Caching scheme Coded caching Index coding Indexes Prefetching Single server Cache memory |
| Sumario: | 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 = ((N2+1)/2). © 2018 IEEE. |
|---|