论文标题
共享缓存编码的缓存方案，具有已知的用户对缓存关联配置文件，使用放置递送数组
Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays
论文作者
论文摘要
这项工作考虑了用户共享缓存的共享缓存的编码缓存问题，每个用户只能访问一个缓存。假定在放置阶段，用户对缓存关联是在服务器上知道的。我们专注于使用放置递送阵列（PDA）得出的方案。 PDA最初是为了解决专用缓存设置中编码缓存的子包装瓶颈而设计的。我们观察到，在本文的设置中，将PDA列的列定为同一问题的方案，但子包装水平保持不变。这与专用的高速缓存网络观察到的相反。我们提出了一个程序，以确定列的顺序，从而为给定问题提供的PDA提供了最佳性能。此外，选择了一些特定类别的PDA，并说明了通过重新排序PDA的列来实现的性能增益。
This work considers the coded caching problem with shared caches, where users share the caches, and each user gets access only to one cache. The user-to-cache association is assumed to be known at the server during the placement phase. We focus on the schemes derived using placement delivery arrays (PDAs). The PDAs were originally designed to address the sub-packetization bottleneck of coded caching in a dedicated cache setup. We observe that in the setup of this paper permuting the columns of the PDA results in schemes with different performance for the same problem, but the sub-packetization level remains the same. This is contrary to what was observed for dedicated cache networks. We propose a procedure to identify the ordering of columns that gives the best performance possible for the PDA employed for the given problem. Further, some specific classes of PDAs are chosen and the performance gain achieved by reordering the columns of the PDA is illustrated.
