Performance modelling of speculative prefetching for compound requests in low bandwidth networks

  • Authors:

  • N. J. Tuah;M. J. Kumar;S. Venkatesh

  • Affiliations:

  • School of Computing, Curtin University of Technology, GPO Box U 1987, WA 8645 Australia;School of Computing, Curtin University of Technology, GPO Box U 1987, WA 8645 Australia;School of Computing, Curtin University of Technology, GPO Box U 1987, WA 8645 Australia

  • Venue:
  • WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

To improve the accuracy of access prediction, a prefetcher for web browsing should recognize the fact that a web page is a compound. By this term we mean that a user request for a single web page may require the retrieval of several multimedia items. Our prediction algorithm builds an access graph that captures the dynamics of web navigation rather than merely attaching probabilities to hypertext structure. When it comes to making prefetch decisions, most previous studies in speculative prefetching resort to simple heuristics, such as prefetching an item with access probabilities larger than a manually tuned threshold. The paper takes a different approach. Specifically, it models the performance of the prefetcher and develops a prefetch policy based on a theoretical analysis of the model. In the analysis, we derive a formula for the expected improvement in access time when prefetch is performed in anticipation for a compound request. We then develop an algorithm that integrates prefetch and cache replacement decisions so as to maximize this improvement. We present experimental results to demonstrate the effectiveness of compound-based prefetching in low bandwidth networks.