A Popularity-Based Prediction Model for Web Prefetching

The diverse server, client, and unique file object types used today slow Web performance. Caching alone offers limited performance relief because it cannot handle many different file types easily. One solution combines caching with Web prefetching: obtaining the Web data a client might need from data about that client's past surfing activity. The prediction by partial match model, for example, makes prefetching decisions by reviewing URLs clients have accessed on a particular server, then structuring them in a Markov predictor tree. The authors propose a variation of this model that builds common surfing patterns and regularities into the tree.

[1]  Leonard Kleinrock,et al.  An adaptive network prefetch scheme , 1998, IEEE J. Sel. Areas Commun..

[2]  Javed I. Khan,et al.  Partial Prefetch for Faster Surfing in Composite Hypermedia , 2001, USITS.

[3]  Themistoklis Palpanas,et al.  Web prefetching using partial match prediction , 1998 .

[4]  Ian H. Witten,et al.  Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..

[5]  Dan Duchamp,et al.  Prefetching Hyperlinks , 1999, USENIX Symposium on Internet Technologies and Systems.

[6]  Wei Lin,et al.  Web prefetching between low-bandwidth clients and proxies: potential and performance , 1999, SIGMETRICS '99.

[7]  Huberman,et al.  Strong regularities in world wide web surfing , 1998, Science.

[8]  Darrell D. E. Long,et al.  Exploring the Bounds of Web Latency Reduction from Caching and Prefetching , 1997, USENIX Symposium on Internet Technologies and Systems.

[9]  Li Xiao,et al.  Exploiting Neglected Data Locality in Browsers , 2001, WWW Posters.

[10]  Peter Pirolli,et al.  Mining Longest Repeating Subsequences to Predict World Wide Web Surfing , 1999, USENIX Symposium on Internet Technologies and Systems.