Using current web page structure to improve prefetching performance

  • Authors:

  • Josep Domenech;Jose A. Gil;Julio Sahuquillo;Ana Pont

  • Affiliations:

  • Department of Computer Engineering (DISCA), Universitat Politecnica de Valencia, Cami de Vera, s/n. 46022 Valencia, Spain;Department of Computer Engineering (DISCA), Universitat Politecnica de Valencia, Cami de Vera, s/n. 46022 Valencia, Spain;Department of Computer Engineering (DISCA), Universitat Politecnica de Valencia, Cami de Vera, s/n. 46022 Valencia, Spain;Department of Computer Engineering (DISCA), Universitat Politecnica de Valencia, Cami de Vera, s/n. 46022 Valencia, Spain

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Web prefetching is a technique aimed at reducing user-perceived latencies in the World Wide Web. The spatial locality shown by user accesses makes it possible to predict future accesses from the previous ones. A prefetching engine uses these predictions to prefetch web objects before the user demands them. The existing prediction algorithms achieved an acceptable performance when they were proposed but the high increase in the number of embedded objects per page has reduced their effectiveness in the current web. In this paper, we show that most of the predictions made by the existing algorithms are not useful to reduce the user-perceived latency because these algorithms do not take into account the structure of the current web pages, i.e., an HTML object with several embedded objects. Thus, they predict the accesses to the embedded objects in an HTML after reading the HTML itself. For this reason, the prediction is not made early enough to prefetch the objects and, therefore, there is no latency reduction. In this paper we present the double dependency graph (DDG) algorithm that distinguishes between container objects (HTML) and embedded objects to create a new prediction model according to the structure of the current web. Results show that, for the same number of extra requests to the server, DDG reduces the perceived latency, on average, 40% more than the existing algorithms. Moreover, DDG distributes latency reductions more homogeneously among users.