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

异构失真要求下的编码缓存

On Coded Caching with Heterogeneous Distortion Requirements

Abdelrahman M. Ibrahim, Ahmed A. Zewail, Aylin Yener

摘要:

本文考虑异构编码缓存的用户有不平等的失真要求。服务器通过一个无错误的多播链接连接到用户,并根据总的内存预算设计用户的缓存大小。特别地,在放置阶段,服务器联合设计用户的缓存大小和缓存内容。为了满足用户的请求,在交付阶段,服务器发送满足用户失真要求的信号。提出了一个以最小化最坏情况下的传输负载为目标的优化问题,该优化问题的目标是满足总的缓存预算和用户的失真要求。未编码的位置和线性交付的最佳解决方案的特点明确,并表现出相对于总的高速缓存内存预算的阈值政策。作为研究的副产品,提出了一种用于具有固定缓存大小的系统的缓存方案,该方案优于最先进的技术。

英文摘要:

This paper considers heterogeneous coded caching where the users have unequal distortion requirements. The server is connected to the users via an error-free multicast link and designs the users' cache sizes subject to a total memory budget. In particular, in the placement phase, the server jointly designs the users' cache sizes and the cache contents. To serve the users' requests, in the delivery phase, the server transmits signals that satisfy the users' distortion requirements. An optimization problem with the objective of minimizing the worst-case delivery load subject to the total cache memory budget and users' distortion requirements is formulated. The optimal solution for uncoded placement and linear delivery is characterized explicitly and is shown to exhibit a threshold policy with respect to the total cache memory budget. As a byproduct of the study, a caching scheme for systems with fixed cache sizes that outperforms the state-of-art is presented.

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

↑