By Topic

A popularity-based prediction model for Web prefetching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xin Chen ; Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA ; Xiaodong Zhang

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.

Published in:

Computer  (Volume:36 ,  Issue: 3 )