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

一种新的递归编码缓存结构

A Novel Recursive Construction for Coded Caching Schemes

Minquan Cheng, Jing Jiang, Youzhi Yao

摘要:

编码缓存作为一种在无线网络中进一步降低高峰时段传输压力的策略,近年来得到了广泛的研究。针对实际应用中的两个核心问题,在高峰流量时间期间传输的速率和在非高峰流量时间期间划分的每个文件的数据包数量。众所周知,在速率和分组数目之间存在折衷。本文提出了一种新的递归结构。作为应用,得到了几种新的方案。与已有的方案相比,新方案可以通过增加较小的速率来进一步减少数据包数。对于编码缓存系统中的某些参数,我们提出的新方案的数据包数小于缓存领域中广泛使用的内存共享方法产生的数据包数。顺便说一下,我们的新方案包括了Tang等人构造的所有结果,(IEEE ISIT,2790-2794,2017)作为特例。

英文摘要:

As a strategy to further reduce the transmission pressure during the peak traffic times in wireless network, coded caching has been widely studied recently. And several coded caching schemes are constructed focusing on the two core problems in practice, i.e., the rate transmitted during the peak traffic times and the packet number of each file divided during the off peak traffic times. It is well known that there exits a tradeoff between the rate and the packet number. In this paper, a novel recursive construction is proposed. As an application, several new schemes are obtained. Comparing with previously known schemes, new schemes could further reduce packet number by increasing little rate. And for some parameters in coded caching systems, the packet number of our new schemes are smaller than that of schemes generated by memory sharing method which is widely used in the field of caching. By the way our new schemes include all the results constructed by Tang et al., (IEEE ISIT, 2790-2794, 2017) as special cases.

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

↑