论文标题
编码的缓存通常不会从自私的缓存中受益
Coded Caching Does Not Generally Benefit From Selfish Caching
论文作者
论文摘要
在典型的编码缓存方案中，中央库的内容被认为对所有接收用户都感兴趣。但是，在现实的情况下，用户可能具有不同的兴趣，这些兴趣可能会相交到各个程度。例如，如果每个文件都具有潜在的兴趣，例如$ 40 \，\％$的用户和每个用户在库中有潜在的利息，会发生什么？如果每个用户仅从潜在感兴趣的内容中自私地缓存怎么办？在这项工作中，我们制定了对称的自私编码的缓存问题，每个用户自然地从库的一个子集中提出请求，该子集定义了自己的文件需求集（FDS），并且仅从其自己的FDS中自私地填充了内容。对于不同的FDS在某种程度上对称重叠的情况下，我们提出了一种新型的信息理论匡威，揭示，对于这种对称的FDS结构的这种一般设置，自私的编码缓存会产生负载性能，这比标准编码的缓存中严格差。
In typical coded caching scenarios, the content of a central library is assumed to be of interest to all receiving users. However, in a realistic scenario the users may have diverging interests which may intersect to various degrees. What happens for example if each file is of potential interest to, say, $40\,\%$ of the users and each user has potential interest in $40\,\%$ of the library? What if then each user caches selfishly only from content of potential interest? In this work, we formulate the symmetric selfish coded caching problem, where each user naturally makes requests from a subset of the library, which defines its own file demand set (FDS), and caches selfishly only contents from its own FDS. For the scenario where the different FDSs symmetrically overlap to some extent, we propose a novel information-theoretic converse that reveals, for such general setting of symmetric FDS structures, that selfish coded caching yields a load performance which is strictly worse than that in standard coded caching.
