arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.06204cs.PFcs.NI
收藏

关于LRU Cache的TTL近似在独立平稳请求过程下的收敛性

On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes

Bo Jiang, Philippe Nain, Don Towsley

摘要:

LRU缓存的建模和分析极具挑战性,因为主要性能指标(例如命中率)的准确结果要么缺乏,要么无法使用,因为它们对于大型缓存的计算复杂性很高。因此,已经提出了各种近似值。国家的最先进的方法是所谓的TTL近似,首先提出并证明是渐近准确的要求,由Fagin。它已被应用于各种其他工作量模型,并在数字上证明是准确的,但没有理论上的理由。在本文中,我们提供的近似的情况下,不同的内容是由独立的平稳和遍历过程描述的理论依据。我们表明,这种近似是准确的缓存大小和内容的数量到无穷大。这扩展了独立参考模型的早期结果。此外,我们建立的结果不仅为总缓存命中概率,但也为每个单独的内容。最后,我们得到了收敛速度的界。

英文摘要:

The modeling and analysis of an LRU cache is extremely challenging as exact results for the main performance metrics (e.g. hit rate) are either lacking or cannot be used because of their high computational complexity for large caches. As a result, various approximations have been proposed. The state-of-the-art method is the so-called TTL approximation, first proposed and shown to be asymptotically exact for IRM requests by Fagin. It has been applied to various other workload models and numerically demonstrated to be accurate but without theoretical justification. In this paper we provide theoretical justification for the approximation in the case where distinct contents are described by independent stationary and ergodic processes. We show that this approximation is exact as the cache size and the number of contents go to infinity. This extends earlier results for the independent reference model. Moreover, we establish results not only for the aggregate cache hit probability but also for every individual content. Last, we obtain bounds on the rate of convergence.

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

↑