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

缓存的基本限制

Fundamental Limits of Caching

Mohammad Ali Maddah-Ali, Urs Niesen

摘要:

缓存是一种通过将流行内容预取到最终用户的内存中来降低峰值流量速率的技术。传统上,这些存储器用于部分地从本地缓存的副本而不是通过网络来递送所请求的内容。这种方法提供的增益,我们称之为本地缓存增益,取决于本地缓存大小(即每个用户可用的内存)。在本文中,我们介绍和利用第二个,全球性的,缓存增益不利用传统的缓存方案。该增益取决于聚合全局高速缓存大小(即,在所有用户处可用的累积存储器),即使在用户之间没有协作。为了评估和隔离这两个收益,我们介绍了一个信息理论的制定的缓存问题,专注于其基本结构。对于这种设置,我们提出了一种新的编码缓存方案,利用本地和全局缓存增益,导致倍增的改善峰值速率相比,以前已知的计划。特别地,改进可以是网络中的用户数量的量级。此外,我们认为,所提出的方案的性能是在一个恒定的因素的信息理论的最佳的所有值的问题参数。

英文摘要:

Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through the network. The gain offered by this approach, which we term local caching gain, depends on the local cache size (i.e, the memory available at each individual user). In this paper, we introduce and exploit a second, global, caching gain not utilized by conventional caching schemes. This gain depends on the aggregate global cache size (i.e., the cumulative memory available at all users), even though there is no cooperation among the users. To evaluate and isolate these two gains, we introduce an information-theoretic formulation of the caching problem focusing on its basic structure. For this setting, we propose a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared to previously known schemes. In particular, the improvement can be on the order of the number of users in the network. Moreover, we argue that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.

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

↑