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 higher memory regime.
翻译:这项工作在用户同时拥有私人缓存和共享缓存的环境下研究编码缓存问题。 设置包括一个与一组用户连接的服务器, 由少量自备的辅助器节点协助。 除了辅助器缓存外, 每个用户都拥有一个专用缓存, 该缓存也用于预发文件内容。 每个助手缓存可以为任意数目的用户服务, 但每个用户只得到一个助手缓存的服务。 我们认为两种假设:(a) 服务器事先没有关于用户- 帮手缓存协会的信息, 并且 (b) 服务器在放置阶段本身了解用户- 帮手缓存协会。 我们为上述两个环境设计了未编码的中央编码缓存计划。 对于案件(b), 提议了两种办法, 在某些记忆系统中是最佳的。 此外, 基于切设的下限, 用于显示一个案件(b) 方案在更高的记忆系统中是最佳的 。