Coded caching is a promising technique to smooth the network traffic by storing parts of a content library at at the users' caches. The original coded caching scheme proposed by Maddah-Ali and Niesen (MN) for shared-link caching systems, provides an additional coded caching gain compared to the conventional uncoded caching scheme. In this paper, we consider the multiaccess caching systems formulated by Hachem et al., including a central server containing N files connected to K cache-less users through an error-free shared link, and K cache-nodes, each equipped with a cache memory size of M files. Each user has access to L neighbouring cache-nodes with a cyclic wraparound topology. The coded caching scheme proposed by Hachem et al. suffers from the case that L does not divide K, where the needed number of transmissions (a.k.a. load) is at most four times the load expression for the case where L divides K. Our main contribution is to propose a novel transformation approach to smartly extend the MN scheme to the multiaccess caching systems, such that the load expression of the scheme by Hachem et al. for the case where L divides K, remains achievable in full generality. Moreover, our transformation approach can also be used to extend other coded caching schemes (satisfying some constraints) for the original MN caching systems to the multiaccess systems.
翻译:代码缓存是通向网络交通的有希望的技术,它把内容库的一部分储存在用户的缓存处。 Maddah- Ali 和 Niesen (MN) 为共享链接缓存系统提议的最初编码缓存办法,提供了与常规的未编码缓存办法相比的额外编码缓存办法。 在本文中,我们认为Hachem 等人开发的多存缓存系统,包括一个中央服务器,内含通过无误共享链接连接与 K 缓存用户连接的N 文档,以及K 缓存节点,每个都配有M 文档的缓存内存大小。 每个用户都可以使用相邻的带有环环环包装表的缓存点。 Hachem 等人 提议的编码缓存办法由于L 不分割 K(a.k.a.) 等常规缓存系统(a.a.a.a.a.) 所需传输量最多是Lf sting K. 的负载量表达方式的四倍。 我们的主要贡献是提出一种新的转变方法,将MN 计划向多处的缓存系统扩展至多处的缓存系统, 也用了Hachemal 。