# K Users Caching Two Files: An Improved Achievable Rate

K Users Caching Two Files: An Improved Achievable Rate - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Presented at: 50th Annual Conference on Information Sciences and Systems (CISS), Princeton, New Jersey, USA, March 16-18, 2016 Accepted in: 2016 Annual Conference On Information Science And Systems (Ciss) (ISBN: 978-1-4673-9457-4) New York: Ieee, 2016

Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we improve upon the existing results and introduce a novel caching strategy that takes advantage of simultaneous coded placement and coded delivery in order to decrease the worst case achievable rate with $2$ files and $K$ users. We will show that for any cache size $\frac{1}{K} < M < 1$ our scheme outperforms the state of the art.

Keywords: Coded Caching ; Content Delivery ; Improved Achievable Rate Reference EPFL-CONF-217949View record in Web of Science

Autor: Sahraei, Saeid; Gastpar, Michael C.

Fuente: https://infoscience.epfl.ch/record/217949?ln=en