2017/12/04 by Parisa Hassanzadeh, Antonia M. Tulino, Hassanzadeh, Parisa +5
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks
paper · pdf · doi:10.48550/arxiv.1712.01464
openalex publication_date 2017/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The correlation among the content distributed across a cache-aided broadcast\nnetwork can be exploited to reduce the delivery load on the shared wireless\nlink. This paper considers a two-user three-file network with correlated\ncontent, and studies its fundamental limits for the worst-case demand. A class\nof achievable schemes based on a two-step source coding approach is proposed.\nLibrary files are first compressed using Gray-Wyner source coding, and then\ncached and delivered using a combination of correlation-unaware cache-aided\ncoded multicast schemes. The second step is interesting in its own right and\nconsiders a multiple-request caching problem, whose solution requires coding in\nthe placement phase. A lower bound on the optimal peak rate-memory trade-off is\nderived, which is used to evaluate the performance of the proposed scheme. It\nis shown that for symmetric sources the two-step strategy achieves the lower\nbound for large cache capacities, and it is within half of the joint entropy of\ntwo of the sources conditioned on the third source for all other cache sizes.\n