LRU缓存性能的通用且精确的近似值
A versatile and accurate approximation for LRU cache performance
摘要：
在2002年的一篇论文中，Che和合著者提出了一种简单的方法来估计最近最少使用（LRU）替换策略的缓存的命中率。近似证明非常准确，适用于相当普遍的对象流行度分布。本文提供了一个数学解释的成功的近似，特别是在配置的直观参数的车，等人显然不适用。近似是特别有用的信息为中心的网络，其中其他方法失败，由于要考虑的非常大的人口的可缓存对象和他们的复杂的流行规律，从不同的内容类型的混合和过滤效果引起的缓存层次结构中的较低层的性能评估当前的建议。
英文摘要：
In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che, et al clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law, resulting from the mix of different content types and the filtering effect induced by the lower layers in a cache hierarchy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
