Properties of the working-set model
Communications of the ACM
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Characterizing locality, evolution, and life span of accesses in enterprise media server workloads
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
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
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
Modeling correlations in web traces and implications for designing replacement policies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling epidemic information dissemination on mobile devices with finite buffers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Modeling and Caching of Peer-to-Peer Traffic
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
An overview of web caching replacement algorithms
IEEE Communications Surveys & Tutorials
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
The Scope for online social network aided caching in web CDNs
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
| Hi-index | 0.00 |
One of the most widely considered cache replacement policies is least recently used (LRU) based on which many other policies have been developed. LRU has been studied analytically in the literature under the assumption that the object requests are independent. However, such an assumption does not seem to be in agreement with recent studies of Web-traces, which indicate the existence of short term correlations among the requests. This paper introduces an approximate analysis that fairly accurately predicts the hit ratio of the LRU policy in the case of short term correlations. The approximation approach is based on the relation between the working set model and LRU, while the request generation process is assumed to follow a recently proposed model for Web-traces, which captures short term correlations among the requests. The accuracy of the introduced approximate analysis is validated for synthetic as well as real Web-traces.