论文标题
编码缓存和分布式计算方案的通用框架
A generic framework for coded caching and distributed computation schemes
论文作者
论文摘要
几个网络通信问题高度相关，例如编码的缓存和分布式计算。集中式编码的缓存着重于减少无线网络系统中的高峰时段的网络负担，以及编码的分布式计算研究分布式系统中计算与通信之间的权衡。在本文中，我们的唯一彩虹$ 3 $ - 学期算术进度集的动机，我们提出了一个统一构建编码的缓存方案的统一框架。由于家庭和行动的选择自由，该框架在编码的缓存方案和许多组合对象之间建立了桥梁。我们证明，基于放置递送阵列（PDA）的任何方案都可以由该框架下的彩虹方案表示，并且该框架也可以包括许多其他已知方案。此外，我们还提出了一种新的编码缓存方案，具有线性子包装和接近恒定的速率，使用唯一的彩虹$ 3 $ - 学期算术进程集。接下来，我们修改框架以适用于分布式计算问题。我们在洗牌阶段提出了一种新的传输方案，并表明在某些情况下，它的通信负载可能比基于PDA的方案或具有相同数量文件数量的可分解设计的方案较低。
Several network communication problems are highly related such as coded caching and distributed computation. The centralized coded caching focuses on reducing the network burden in peak times in a wireless network system and the coded distributed computation studies the tradeoff between computation and communication in distributed system. In this paper, motivated by the study of the only rainbow $3$-term arithmetic progressions set, we propose a unified framework for constructing coded caching schemes. This framework builds bridges between coded caching schemes and lots of combinatorial objects due to the freedom of the choices of families and operations. We prove that any scheme based on a placement delivery array (PDA) can be represented by a rainbow scheme under this framework and lots of other known schemes can also be included in this framework. Moreover, we also present a new coded caching scheme with linear subpacketization and near constant rate using the only rainbow $3$-term arithmetic progressions set. Next, we modify the framework to be applicable to the distributed computing problem. We present a new transmission scheme in the shuffle phase and show that in certain cases it could have a lower communication load than the schemes based on PDAs or resolvable designs with the same number of files.
