A caching relay for the World Wide Web
Selected papers of the first conference on World-Wide Web
Main memory caching of Web documents
Proceedings of the fifth international World Wide Web conference on Computer networks and ISDN systems
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proxy caching that estimates page load delays
Selected papers from the sixth international conference on World Wide Web
A case for delay-conscious caching of Web documents
Selected papers from the sixth international conference on World Wide Web
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
IEEE Transactions on Knowledge and Data Engineering
Characteristics of WWW Client-based Traces
Characteristics of WWW Client-based Traces
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
| Hi-index | 0.00 |
Web caching is a scalable and effective way to reduce network traffic and response time. In this study, we propose a new cache replacement policy for proxy and Web servers, the Size-Adjusted Sliding Window LFU (SSW-LFU). In this policy, we use the rates of recent accesses within a sliding window to estimate the probability of future document accesses. In addition, we take into account the variable sizes of documents. Simulations with real-life web access data are conducted to evaluate the performance. SSW-LFU outperformed other algorithms in hit ratio and had comparable byte hit ratio when compared with other algorithms such as LFU, LRU, Size, LRU-Min, etc.