Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance Li Fan, Pei Cao and Wei Lin Department of Computer Science University of Wisconsin-Madison { lfan, cao, weilin} @cs.wise. edu Quinn Jacobson Department of Electrical and Computer Engineering University of Wisconsin-Madison qjacobso@ece.wisc.edu Abstract The majority of the Internet population access the World Wide Web via dial-up modem connections. Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users. In this paper, we investigate one approach to reduce latency: prefetching between caching proxies and browsers. The approach relies on the proxy to predict which cached documents a user might reference next, and takes advantage of the idle time between user requests to push or pull the documents to the user. Using traces of modem Web accesses, we evaluate the potential of the technique at reducing client latency, examine the design of prediction algorithms, an d investigate their performance varying the parameters and implementation concerns. Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23.4%. The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm, whose accuracy ranges from 40% to 73% depending on its
/lp/association-for-computing-machinery/web-prefetching-between-low-bandwidth-clients-and-proxies-potential-G7tQOH9YTn