arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.16845cs.ITmath.IT
收藏

一种最优的分布式多接入编码缓存系统

An Optimal Decentralized Multi-access Coded Caching System

Monolina Dutta, Anoop Thomas, B. Sundar Rajan

AI总结:

本文研究分布式预取的多接入编码缓存系统,提出两种线性传输方案并证明其在对应场景下的最优性,推广了现有缓存方案结果,提升了系统适配任意用户数量的灵活性。

摘要:

本文研究了具备分布式预取的多接入编码缓存系统,其中服务器存储$N$个文件,每个文件大小为$F$比特,并通过共享链路连接$K$个用户。网络中分布着$c$个缓存,$K$个用户中的每一个都连接到一个大小为$r\leq c$的随机缓存集合。首先,我们考虑每个缓存子集恰好被特定数量的用户访问的模型。针对该模型,本文提出了一种新颖的线性传输方案,并利用该方案计算出了单用户传输速率的闭式表达式。此外,借助索引编码技术,本文证明了所提出的线性传输方案在所有线性传输方案中的最优性。分布式共享缓存方案和传统分布式缓存方案的结果均可作为所提模型的特例推导得出。本文进一步推广了该模型,允许每个缓存子集为任意数量的用户服务。这提升了系统的灵活性,使其能够适配任意数量的用户。针对该广义模型,本文提出了一种传输方案,并证明其在特定用户-缓存关联场景下具有最优性。

英文摘要:

In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed across the network and each of the $K$ users connects to a random set of $r\leq c$ caches. Initially, we consider the model in which each of the cache subsets is accessed by exactly a specific number of users. For this model, a novel linear delivery scheme is introduced, using which the closed-form expression for the per-user delivery rate is computed. Furthermore, using techniques from index coding, the optimality of the proposed linear delivery scheme among all linear delivery schemes is proved. The results of the decentralized shared caching and conventional decentralized caching schemes are recovered as special cases of the proposed model. The model is further generalized by allowing each cache subset to serve any number of users. This enhances the flexibility of the system, enabling it to accommodate any arbitrary number of users. A delivery scheme is proposed for the generalized model and is shown to be optimal for certain user-to-cache associations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑