2016/06/14 by Avik Sengupta, Sengupta, Avik, Ravi Tandon +1 · 1 citation
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1606.04202
openalex publication_date 2016/06/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Caching at the network edge has emerged as a viable solution for alleviating\nthe severe capacity crunch in modern content centric wireless networks by\nleveraging network load-balancing in the form of localized content storage and\ndelivery. In this work, we consider a cache-aided network where the cache\nstorage phase is assisted by a central server and users can demand multiple\nfiles at each transmission interval. To service these demands, we consider two\ndelivery models - (1) centralized content delivery where user demands at each\ntransmission interval are serviced by the central server via multicast\ntransmissions; and (2) device-to-device (D2D) assisted distributed delivery\nwhere users multicast to each other in order to service file demands. For such\ncache-aided networks, we present new results on the fundamental cache storage\nvs. transmission rate tradeoff. Specifically, we develop a new technique for\ncharacterizing information theoretic lower bounds on the storage-rate tradeoff\nand show that the new lower bounds are strictly tighter than cut-set bounds\nfrom literature. Furthermore, using the new lower bounds, we establish the\noptimal storage-rate tradeoff to within a constant multiplicative gap. We show\nthat, for multiple demands per user, achievable schemes based on repetition of\nschemes for single demands are order-optimal under both delivery models.\n