On Coded Caching with Heterogeneous Distortion Requirements
Abdelrahman M. Ibrahim, Ahmed A. Zewail, and Aylin Yener

TL;DR
This paper investigates coded caching for users with different distortion needs, optimizing cache sizes and contents to minimize delivery load under a total memory constraint, and proposes an improved caching scheme.
Contribution
It introduces a joint cache design approach for heterogeneous distortion requirements and explicitly characterizes the optimal solution with a threshold policy.
Findings
Optimal cache placement and delivery strategies are derived.
A threshold policy with respect to total cache memory is identified.
A new caching scheme outperforms existing methods for fixed cache sizes.
Abstract
This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users' cache sizes subject to a total memory budget. In particular, in the placement phase, the server jointly designs the users' cache sizes and the cache contents. To serve the users' requests, in the delivery phase, the server transmits signals that satisfy the users' distortion requirements. An optimization problem with the objective of minimizing the worst-case delivery load subject to the total cache memory budget and users' distortion requirements is formulated. The optimal solution for uncoded placement and linear delivery is characterized explicitly and is shown to exhibit a threshold policy with respect to the total cache memory budget. As a byproduct of the study, a caching scheme for…
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.
