2019/02/12 by Yousef AlHassoun, Faisal Alotaibi, AlHassoun, Yousef +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.1902.04600
openalex publication_date 2019/02/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Coded caching techniques have received significant attention lately due to\ntheir provable gains in reducing the cost of data delivery in wireless\nnetworks. These gains, however, have only been demonstrated under the\nassumption of a free placement phase. This unrealistic assumption poses a\nsignificant limitation, especially in cases where aggressive placement\nstrategies can lead to a significant transmission cost that may even be higher\nthan the corresponding cost of the delivery phase. In this paper, we relax this\nassumption and propose a general caching framework that captures the\ntransmission cost of the two phases, and hence, results in minimizing the\noverall rate of the caching network. We model the dynamic nature of the network\nthrough a cost structure that allows for varying the network architecture and\ncost per transmission, across the placement and delivery phases. We start with\nthe scenario where the individual users have no limit on the available caching\nmemory and characterize the jointly optimal solution as a function of the\ndifferent parameters in our cost structure. Then, we characterize the effect of\nmemory constraints on the optimal solution in certain special cases.\nInterestingly, our results identify regions where the uncoded caching scheme\noutperforms its coded counterpart. Further, coded caching is shown to offer\nperformance gains only when the network architecture during the placement phase\nis different from that during the delivery phase.\n