论文标题
带有共享的缓存和私人卡车的编码缓存
Coded Caching with Shared Caches and Private Caches
论文作者
论文摘要
这项工作研究了用户同时赋予私人缓存和共享缓存的环境中编码的缓存问题。该设置由连接到一组用户的服务器组成，并在配备了自己的存储空间的少量辅助节点的帮助下。除了辅助缓存外，每个用户还具有专用的缓存，该缓存也用于预取文件内容。每个辅助缓存可以为任意数量的用户提供服务，但是每个用户只能由一个助手缓存服务。我们考虑了两种情况：（a）服务器没有有关用户对助焊剂关联的事先信息，并且（b）服务器知道位置阶段本身的用户对助手缓存关联。我们在未编码的位置下设计了集中的编码缓存方案，用于上述两个设置。对于案例（b），提出了两种方案，这些方案在某些内存制度中是最佳的。此外，得出了基于切割的下限，并用于证明案例（b）提出的一种方案之一在某些内存制度中是最佳的。
This work studies the coded caching problem in a setting where the users are simultaneously endowed with a private cache and a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of helper nodes that are equipped with their own storage. In addition to the helper cache, each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache can serve an arbitrary number of users, but each user gets served by only one helper cache. We consider two scenarios: (a) the server has no prior information about the user-to-helper cache association, and (b) the server knows the user-to-helper cache association at the placement phase itself. We design centralized coded caching schemes under uncoded placement for the above two settings. For case (b), two schemes are proposed that are optimal in certain memory regimes. Further, a cut-set based lower bound is derived and used to show that one of the proposed schemes for case (b) is optimal in certain memory regime.
