27 March 2001 Web caching and prefetching: a data mining approach
Author Affiliations +
Abstract
With the increase in popularity of the Internet, the latency experienced by an individual, while accessing the Web, is increasing. In this paper, we investigate one approach to reducing latency by increasing the hit rate for a web cache. To this effect, we developed a predictive model for pre- fetching and a modified Least Recently Used (LRU) method called AssocLRU. This paper investigates the application of a data mining technique, called Association rules to the web domain. The association rules, predict the URLs a user might reference next, and this knowledge is used in our web caching and pre-fetching model. We developed a trace driven cache simulator to compare the performance of our predictive model with the widely used replacement policy, namely, LRU. The traces we used in our experiments were the traces of Web proxy activity taken at Virginia Tech and EPA HTTP. Our results show that our predictive pre-fetching model using association rules achieves a better hit rate than both LRU and AssocLRU.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Amidha Shyamsukha, Archana Sathaye, Arun Swami, "Web caching and prefetching: a data mining approach", Proc. SPIE 4384, Data Mining and Knowledge Discovery: Theory, Tools, and Technology III, (27 March 2001); doi: 10.1117/12.421062; https://doi.org/10.1117/12.421062
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

One to one modeling and simulation a new approach...
Proceedings of SPIE (March 12 2002)
Data mining and decision making
Proceedings of SPIE (March 12 2002)
MRMAide: a mixed resolution modeling aide
Proceedings of SPIE (July 15 2002)
Comparison of stream merging algorithms for media-on-demand
Proceedings of SPIE (December 10 2001)

Back to Top