Coded Caching for Broadcast Networks with User Cooperation
Jiahui Chen, Xiaowen You, Youlong Wu, and Shuai Ma

TL;DR
This paper introduces new coded caching schemes for broadcast networks with user cooperation, achieving near-optimal transmission delay by exploiting parallel data delivery and cooperation gains in both centralized and decentralized settings.
Contribution
Proposes novel coded caching schemes that are order-optimal and leverage user cooperation and parallel transmission to reduce delay in broadcast networks.
Findings
Centralized scheme is order-optimal within a constant factor.
Decentralized scheme is order-optimal when cache size exceeds a threshold.
User cooperation and parallel transmission significantly reduce transmission delay.
Abstract
In this paper, we investigate the transmission delay of cache-aided broadcast networks with user cooperation. Novel coded caching schemes are proposed for both centralized and decentralized caching settings, by efficiently exploiting time and cache resources and creating parallel data delivery at the server and users. We derive a lower bound on the transmission delay and show that the proposed centralized coded caching scheme is \emph{order-optimal} in the sense that it achieves a constant multiplicative gap within the lower bound. Our decentralized coded caching scheme is also order-optimal when each user's cache size is larger than the threshold (approaching 0 as ), where is the total number of users and is the size of file library. Moreover, for both the centralized and decentralized caching settings, our schemes obtain an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
