This paper considers the multiaccess coded 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 wrap-around 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 schemes satisfying some conditions for the well known shared-link caching systems to the multiaccess caching systems. Then we can get many coded caching schemes with different subpacketizations for multiaccess coded caching system. These resulting schemes have the maximum local caching gain (i.e., the cached contents stored at any $L$ neighbouring cache-nodes are different such that the number of retrieval packets by each user from the connected cache-nodes is maximal) and the same coded caching gain as the original schemes. Applying the transformation approach to the well-known shared-link coded caching scheme proposed by Maddah-Ali and Niesen, we obtain a new multiaccess coded caching scheme that achieves the same load as the scheme of Hachem et al. but for any system parameters. Under the constraint of the cache placement used in this new multiaccess coded caching scheme, our delivery strategy is approximately optimal when $K$ is sufficiently large. Finally, we also show that the transmission load of the proposed scheme can be further reduced by compressing the multicast message.

中文翻译：

---

一种用于多路访问网络的共享链路编码缓存方案的新转换方法

本文考虑了由 Hachem 制定的多路访问编码缓存系统 等。，包括一个中央服务器，其中包含 $N$ 文件连接到 $K$ 通过无错误共享链接的无缓存用户，以及 $K$ 缓存节点，每个节点都配备了一个缓存内存大小 百万美元 文件。每个用户都可以访问 $L$ 具有循环环绕拓扑的相邻缓存节点。Hachem提出的编码缓存方案等。遭受这样的情况 $L$ 不分 $K$ ，其中所需的传输次数（又名负载）最多是负载表达式的四倍，其中 $L$ 分裂 $K$ . 我们的主要贡献是提出一部小说转换方法巧妙地将满足某些条件的方案扩展到众所周知的共享链接缓存系统到多路访问缓存系统。然后我们可以为多路访问编码缓存系统获得许多具有不同子分组化的编码缓存方案。这些结果方案具有最大的本地缓存增益（即，缓存内容存储在任何 $L$ 相邻的缓存节点是不同的，使得每个用户从连接的缓存节点检索数据包的数量是最大的）和与原始方案相同的编码缓存增益。将转换方法应用于著名的由 Maddah-Ali 和 Niesen 提出的共享链接编码缓存方案，我们获得了一种新的多址编码缓存方案，该方案实现了与 Hachem 方案相同的负载等。但对于任何系统参数。在这种新的多路访问编码缓存方案中使用的缓存放置的约束下，我们的交付策略近似最优，当 $K$ 足够大。最后，我们还表明，通过压缩多播消息可以进一步降低所提出方案的传输负载。