On Coded Caching for Two Users with Overlapping Demand Sets

Thumbnail Image
Publication date
Defense date
Journal Title
Journal ISSN
Volume Title
IEEE.The Institute of Electrical And Electronics Engineers, Inc
Google Scholar
Research Projects
Organizational Units
Journal Issue
Coded caching is a technique for reducing congestion in communication networks by prefetching content during idle periods and exploiting multicasting opportunities during periods of heavy traffic. Most of the existing research in this area has focused on minimizing the worst case (i.e., peak) rate in a broadcast link with multiple identically distributed user requests. However, modern content delivery networks are investing very heavily in profiling their users and predicting their preferences. The minimal achievable rate of a coded caching scheme with heterogeneous user profiles is still unknown in general. This paper presents the first steps towards solving that problem by analyzing the case of two users with distinct but overlapping demand sets. Specifically, it provides a complete characterization of the uniform-average-rate capacity when the sets overlap in just one file and shows that such capacity can be achieved with selfish and uncoded prefetching. Then, it characterizes the same capacity under selfish and uncoded prefetching when the demand sets overlap in two or more files. The paper also provides explicit prefetching schemes that achieve those capacities. All our results allow for arbitrary (and not necessarily identical) users' cache sizes and number of files in each demand set.
Proceedings of : 2020 IEEE International Conference on Communications (ICC), 7-11 June 2020, Virtual Conference.
Prefetching, Servers, Synchronization, Encoding, Decoding, Multicast communication, Content distribution networks
Bibliographic citation
Chang, C. J., Wang, C., & Peleato, B. (07-11 June 2020). On Coded Caching for Two Users with Overlapping Demand Sets [proceedings]. ICC 2020 - IEEE International Conference on Communications (ICC). Virtual Conference.