A versatile and accurate approximation for LRU cache performance

Details A versatile and accurate approximation for LRU cache performance A versatile and accurate approximation for LRU cache performance

2012-02-17

arxiv.org/abs/1202.3974v1

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A versatile and accurate approximation for LRU cache performance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A versatile and accurate approximation for LRU cache performance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A versatile and accurate approximation for LRU cache performance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36541