ITW 2022, IEEE Information Theory Workshop, 1-9 November 2022, Mumbai, India (Hybrid Event)
In this paper, we consider a coded caching scenario where users have heterogeneous interests. Taking into consideration the system model originally proposed by Wang
and Peleato, for which the end-receiving users are divided into groups according to their file preferences, we develop a novel information-theoretic converse on the worst-case communication load under uncoded cache placement. Interestingly, the developed
converse bound, jointly with one of the coded schemes proposed by Wang and Peleato, allows us to characterize the optimal worstcase communication load under uncoded prefetching within a constant multiplicative gap of 2. Although we restrict the caching
policy to be uncoded, our work improves the previously known order optimality results for the considered caching problem.
Type:
Conférence
City:
Mumbai
Date:
2022-11-01
Department:
Systèmes de Communication
Eurecom Ref:
7086
Copyright:
© 2022 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
