Web prefetching with high accuracy and low memory cost

Authors:
Qinghui Liu;Roberto Solis-Oba
Affiliations:
Department of Computer Science, The University of Western Ontario, London, Ontario, Canada;Department of Computer Science, The University of Western Ontario, London, Ontario, Canada
Venue:
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Year:
2008

Citing 7
Cited 1

Using predictive prefetching to improve World Wide Web latency

ACM SIGCOMM Computer Communication Review
Web prefetching between low-bandwidth clients and proxies: potential and performance

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Web protocols and practice: HTTP/1.1, Networking protocols, caching, and traffic measurement

Web protocols and practice: HTTP/1.1, Networking protocols, caching, and traffic measurement
Popularity-Based PPM: An Effective Web Prefetching Technique for High Accuracy and Low Storage

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Characteristics of WWW Client-based Traces

Characteristics of WWW Client-based Traces
Mining longest repeating subsequences to predict world wide web surfing

USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Exploring the bounds of web latency reduction from caching and prefetching

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

Web 2.0 proxy: upgrading websites from web 1.0 to web 2.0

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Prefetching algorithms can effectively reduce Web latency and dramatically improve responsiveness of interactive Web application. We propose a new history-based prefetching algorithm that achieves very high prediction accuracy, generates little overhead traffic, and allows users to bound the amount of memory that it uses. We also propose a method to find accurate upper bounds on the performance of any history-based prefetching algorithm.