2015/12/21 by Saeid Sahraei, Michael Gastpar, Sahraei, Saeid +1
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #FOS: Computer and information sciences #Information Theory (cs.IT) #Peer-to-Peer Network Technologies #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1512.06682
arxiv created 2015/12/21 · openalex publication_date 2015/12/21 · arxiv updated 2015/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 (1)/(K)<M<1 our scheme outperforms the state of the art.