Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
GEMA: An Object Replacement Algorithm for Cooperative Web Proxy Systems
Multimedia Tools and Applications
A Scalable Asynchronous Cache Consistency Scheme (SACCS) for Mobile Environments
IEEE Transactions on Parallel and Distributed Systems
A quantitative study of recency and frequency based web cache replacement strategies
Proceedings of the 11th communications and networking simulation symposium
Dynamic cache invalidation scheme for wireless mobile environments
Wireless Networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Many web caching algorithms have been proposed in recent years. However, the lack of analytical support and systematic evaluation environment significantly affect the applicability of these algorithms. In this paper, we introduce a framework within which web caching algorithms can be consistently analyzed and empirically examined. The framework consists of two complementary parts: The statistical model and the simulation environment. The analytical model covers both the web trace characteristics and the caching algorithm behaviors. The simulation system, referred to as WebCASE Web Caching Algorithm Simulation Environment), consists of an extensible simulation core and a front end graphical interface showing the running algorithm behaviors. By using this framework, we are able to better understand the performance discrepancies exhibited by different algorithms and develop more efficient new algorithms. These new algorithms take into consideration practical issues and make noticeable performance improvements over existing algorithms.