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

缓存大小受限的编码缓存系统的新最优折衷点

New optimal trade-off point for coded caching systems with limited cache size

Yinbin Ma, Daniela Tuninetti

AI总结:

本文为缓存大小受限的编码缓存系统提出一种基于线性编码放置和三阶段传输的最优可实现方案,并证明其在特定参数范围内达到最优负载。

摘要:

本文针对具有 $\u006d\u0061\u0074\u0068\u0073\u0066{\u004e}$ 个文件、$\u006d\u0061\u0074\u0068\u0073\u0066{\u004b}=\u006d\u0061\u0074\u0068\u0073\u0066{\u004e}$ 个用户且缓存大小 $\u006d\u0061\u0074\u0068\u0073\u0066{\u004d}=1/(\u006d\u0061\u0074\u0068\u0073\u0066{\u004e}-1)$ 的编码缓存系统提出了一种新的可实现方案。该方案在缓存放置阶段采用线性编码,并设计了三阶段传输以消除交付阶段的干扰。可实现负载满足一个已知的逆界,该逆界对缓存放置不施加任何约束,因此该方案是最优的。这一新结果与已知的内界和外界一起表明,当 $\u006d\u0061\u0074\u0068\u0073\u0066{\u004b}=\u006d\u0061\u0074\u0068\u0073\u0066{\u004e}\u0067\u0065\u0071 3$ 时,对于 $\u006d\u0061\u0074\u0068\u0073\u0066{\u004d} \u006c\u0065\u0071 1/(\u006d\u0061\u0074\u0068\u0073\u0066{\u004e}-1)$,线性编码放置具有最优性。有趣且令人惊讶的是,所提方案相对简单,但需要在大小至少为 3 的有限域上进行运算。

英文摘要:

This paper presents a new achievable scheme for coded caching systems with $\mathsf{N}$ files, $\mathsf{K}=\mathsf{N}$ users, and cache size $\mathsf{M}=1/(\mathsf{N}-1)$. The scheme employs linear coding during the cache placement phase, and a three-stage transmissions designed to eliminate interference in the delivery phase. The achievable load meets a known converse bound, which impose no constraint on the cache placement, and is thus optimal. This new result, together with known inner and outer bounds, shows optimality of linear coding placement for $\mathsf{M} \leq 1/(\mathsf{N}-1)$ when $\mathsf{K}=\mathsf{N}\geq 3$. Interestingly and surprisingly, the proposed scheme is relatively simple but requires operations on a finite field of size at least 3.

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

↑