论文标题
基于常规Digraphs的注入性弧形的线性子包装的编码缓存方案的设计
Design of Coded Caching Schemes with Linear Subpacketizations Based on Injective Arc Coloring of Regular Digraphs
论文作者
论文摘要
编码的缓存是一种有效的技术，可以消除回程链接中的流量量。在这样的方案中，将服务器中托管的每个文件分为多个数据包，以根据缓存到用户和广播消息中的内容的精致设计来追求较低的传输速率。但是，该方案的实现复杂性随数据包数量增加。希望设计一个较小的子包装水平和相对较低的传输速率的方案。最近，提出了放置递送阵列（PDA）来解决编码缓存的子包装瓶颈。本文从新的角度（即定期挖掘物的注入性弧形着色）研究了设计PDA。结果表明，常规挖掘物的注射弧着色可以产生具有相同数量的行和列的PDA。基于此，定义了一类新的常规挖掘图，并得出了此类挖掘物的注入色索引上的上限。因此，提出了一些具有线性子包装级和较小传输速率的新的编码缓存方案，其中一种将概括了现有方案的情况，其用户数量更高。
Coded caching is an effective technique to decongest the amount of traffic in the backhaul link. In such a scheme, each file hosted in the server is divided into a number of packets to pursue a low transmission rate based on the delicate design of contents cached into users and broadcast messages. However, the implementation complexity of this scheme increases with the number of packets. It is desirable to design a scheme with a small subpacketization level and a relatively low transmission rate. Recently, placement delivery array (PDA) was proposed to address the subpacketization bottleneck of coded caching. This paper investigates the design PDA from a new perspective, i.e., the injective arc coloring of regular digraphs. It is shown that the injective arc coloring of a regular digraph can yield a PDA with the same number of rows and columns. Based on this, a new class of regular digraphs are defined and the upper bounds on the injective chromatic index of such digraphs are derived. Consequently, some new coded caching schemes with a linear subpacketization level and a small transmission rate are proposed, one of which generalizes the existing scheme for the scenario with a more flexible number of users.
