Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
On the Optimality of the Probability Ranking Scheme in Storage Applications
Journal of the ACM (JACM)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Temporal locality and its impact on Web proxy cache performance
Performance Evaluation - Special issue on internet performance modelling
The working set model for program behavior
Communications of the ACM
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
On filter effects in web caching hierarchies
ACM Transactions on Internet Technology (TOIT)
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Operating Systems Theory
Stochastic Analysis of Computer Storage
Stochastic Analysis of Computer Storage
Sources and Characteristics of Web Temporal Locality
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Taxonomy and Design Analysis for Distributed Web Caching
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
World Wide Web caching: trends and techniques
IEEE Communications Magazine
Traffic analysis of a Web proxy caching hierarchy
IEEE Network: The Magazine of Global Internetworking
Analysis of set-up time models: A metric perspective
Theoretical Computer Science
Characterizing the miss sequence of the LRU cache
ACM SIGMETRICS Performance Evaluation Review
A rigorous analysis for set-up time models – a metric perspective
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Temporal locality in today's content caching: why it matters and how to model it
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
We consider a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IRM). We characterize the popularity pmf of the stream of misses from the cache, the so-called output of the cache, for a large class of demand-driven cache replacement policies. We measure strength of locality of reference in a stream of requests through the skewness of its popularity distribution. Using the notion of majorization to capture this degree of skewness, we show that for the policy A0 and the random policy, the output always has less locality of reference than the input. However, we show by counterexamples that this is not always the case under the LRU and CLIMB policies when the input is selected according to a Zipf-like pmf. In that case, conjectures are offered (and supported by simulations) as to when LRU or CLIMB caching indeed reduces locality of reference.