论文标题
来自交叉分解设计的多访问编码的缓存方案
Multi-access Coded Caching Schemes From Cross Resolvable Designs
论文作者
论文摘要
我们为多访问网络提供了一种新颖的缓存和编码的交付方案，其中多个用户可以访问同一缓存（共享缓存），任何缓存都可以帮助多个用户。该方案是从满足某些条件的可分解设计中获得的，我们称之为{\ IT交叉分辨设计}。为了能够将不同的多访问编码方案与不同数量的用户进行比较，我们将计划的速率按服务的用户数量标准化。基于此每个用户速率，我们表明我们的方案的性能要比众所周知的Maddah-Ali-Nieson（MAN）方案和最近提出的（“多访问编码的缓存：超越Cache-Redundendence的增长”，由Serbetci，Parrinello和Elia）SPE方案。结果表明，来自仿射平面的可分解设计是交叉分解的设计，我们的方案基于这些表现比大型记忆尺寸案例的人方案更好。还提出了超出我们的性能的确切大小。 SPE方案仅考虑使用用户数量和归一化缓存尺寸的乘积的情况，而拟议的方案则根据可选择的可分配设计允许不同的选择。
We present a novel caching and coded delivery scheme for a multi-access network where multiple users can have access to the same cache (shared cache) and any cache can assist multiple users. This scheme is obtained from resolvable designs satisfying certain conditions which we call {\it cross resolvable designs}. To be able to compare different multi-access coded schemes with different number of users we normalize the rate of the schemes by the number of users served. Based on this per-user-rate we show that our scheme performs better than the well known Maddah-Ali - Nieson (MaN) scheme and the recently proposed ("Multi-access coded caching : gains beyond cache-redundancy" by Serbetci, Parrinello and Elia) SPE scheme. It is shown that the resolvable designs from affine planes are cross resolvable designs and our scheme based on these performs better than the MaN scheme for large memory size cases. The exact size beyond which our performance is better is also presented. The SPE scheme considers only the cases where the product of the number of users and the normalized cache size is 2, whereas the proposed scheme allows different choices depending on the choice of the cross resolvable design.
