Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief ["Fundamental limits of caching: improved bounds for users with small buffers," (IET Communications), 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is assumed to be error prone only during the delivery phase. Closed form expressions for average rate and peak rate of error correcting delivery scheme for CFL prefetching scheme is obtained. An optimal error correcting delivery scheme for caching problems employing CFL prefetching is proposed.
翻译：Chen, Fan 和 Letaief[“缓冲基本限值:为小缓冲用户改进边框” (IET通讯,2016年)] 提出了用于低缓冲大小和不少于服务器文件量的用户数的编码缓存问题的优化交付计划。这个计划被称为 CFL 计划。本文假定,服务器和用户之间的联系只有在交付阶段才易出错。 获得了CFL预缓冲计划的平均速率和最高误差率校正交付计划的封闭形式表达式。 提出了一个最佳错误纠正使用 CFL 预缓冲的缓冲问题的交付计划 。
相关内容
微信扫码咨询专知VIP会员