English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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