论文标题
关于具有异质用户配置文件的编码缓存的最佳性
On the Optimality of Coded Caching With Heterogeneous User Profiles
论文作者
论文摘要
在本文中，我们考虑了用户具有异质兴趣的编码缓存方案。考虑到Wang和Peleato最初提出的系统模型，为此，最终接收的用户根据其文件偏好分为组，我们在未编码的高速缓存放置下开发了一种新颖的信息理论匡威。有趣的是，开发的匡威绑定，与Wang和Peleato提出的一种编码方案共同结合，使我们能够表征在恒定的乘以$ 2 $的恒定乘法间隔内未经编码的预取料中最佳的最差通信负载。尽管我们限制了未编码的缓存策略，但我们的工作改善了以前已知的订单最佳结果，用于考虑的缓存问题。
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 optimal 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 worst-case 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.
