TTL缓存网络的精确分析--以停时驱动的缓存策略为例
Exact Analysis of TTL Cache Networks: The Case of Caching Policies driven by Stopping Times
摘要：
TTL缓存模型最近重新获得了重要的研究兴趣，主要是由于它们能够适应流行的缓存策略，如LRU。本文提出了基于TTL的缓存网络的最先进的分析，通过开发两个正交的通用性和计算复杂性的精确方法。第一种方法概括了现有的结果更新请求下的线网络的缓存政策，从而驱逐的停止时间驱动的广泛的类。所得到的结果进一步推广，使用第二种方法，前馈网络与马尔可夫到达过程（MAP）的要求。MAP特别适合于非线网络，因为它们不仅在叠加和分裂下是闭合的，如已知的，而且在输入-输出高速缓存操作下也是闭合的，如本文针对相位型TTL分布所证明的。这两个封闭属性的关键好处是，它们共同使第一次精确分析的前馈网络的TTL缓存在很大程度上的一般性。
英文摘要：
TTL caching models have recently regained significant research interest, largely due to their ability to fit popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times. The obtained results are further generalized, using the second method, to feedforward networks with Markov arrival processes (MAP) requests. MAPs are particularly suitable for non-line networks because they are closed not only under superposition and splitting, as known, but also under input-output caching operations as proven herein for phase-type TTL distributions. The crucial benefit of the two closure properties is that they jointly enable the first exact analysis of feedforward networks of TTL caches in great generality.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
