论文标题
记忆率的折衷方案用于缓存，并在不均匀的文件受欢迎下放置未编码的位置
Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity
论文作者
论文摘要
对于具有不一致的文件受欢迎程度的缓存，我们旨在表征未编码的缓存位置下的内存率折衷。我们考虑了最近提出的改进的编码缓存方案（MCC），其基于普遍性优先的方法优化的缓存位置，以最大程度地降低平均输送率。我们介绍了两个信息理论的下限，以在未编码的放置下缓存的平均速率。对于$ k = 2 $的用户，我们证明了优化的MCC达到下限，并且最适合通过未编码的放置缓存。对于具有不同文件请求的一般$ k $用户，优化的MCC可以达到普及至上的下限。当$ k $用户之间有冗余的文件请求时，我们显示了优化的MCC和下限之间可能存在差距，这归因于通常用于编码交付的零铺平。我们分析了零盖的影响及其限制。模拟研究表明，损失通常很小，只有在某些有限的情况下才存在。
For caching with nonuniform file popularity, we aim to characterize the memory-rate tradeoff under uncoded cache placement. We consider the recently proposed Modified Coded Caching Scheme (MCCS) with the optimized cache placement based on the popularity-first approach to minimize the average delivery rate. We introduce two information-theoretic lower bounds on the average rate for caching under uncoded placement. For $K = 2$ users, we show that the optimized MCCS attains the lower bound and is optimal for caching with uncoded placement. For general $K$ users with distinct file requests, the optimized MCCS attains the popularity-first-based lower bound. When there are redundant file requests among $K$ users, we show a possible gap between the optimized MCCS and the lower bounds, which is attributed to zero-padding commonly used for coded delivery. We analyze the impact of zero-padding and its limitation. Simulation study shows that the loss is very small in general and only exists in some limited cases.
