Coordinated data prefetching for web contents

With the development of active proxy, the functions of a proxy have been enhanced beyond simply storing Web contents. Web prefetching activity in proxy is such an example to reduce client-perceived latency. In this paper, we propose a coordinated proxy-server prefetching technique that adaptively utilizes the access information and coordinates prefetching activities at both proxy and Web servers. In our design, the access information stored in proxies will be the main source serving data prefetching for groups of clients sharing common surfing interests. The access information in the Web server will be used to serve data prefetching only for data objects that are not qualified for proxy-based prefetching. Conducting trace-driven simulations, we show that both hit ratios and byte hit ratios contributed from coordinated proxy-server prefetching are 30-75% higher than other prefetching schemes, and they are comparable to the ratios from a proxyless server-based prefetching that is able to observe every access to the server.

[1]  Jeffrey C. Mogul,et al.  Using predictive prefetching to improve World Wide Web latency , 1996, CCRV.

[2]  Peter Pirolli,et al.  Mining Longest Repeating Subsequences to Predict World Wide Web Surfing , 1999, USENIX Symposium on Internet Technologies and Systems.

[3]  Javed I. Khan,et al.  Partial Prefetch for Faster Surfing in Composite Hypermedia , 2001, USITS.

[4]  Michael D. Smith,et al.  Using Path Profiles to Predict HTTP Requests , 1998, Comput. Networks.

[5]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[6]  Shlomo Moran,et al.  Optimizing result prefetching in web search engines with segmented indices , 2002, TOIT.

[7]  Ramesh R. Sarukkai,et al.  Link prediction and path analysis using Markov chains , 2000, Comput. Networks.

[8]  Xin Chen,et al.  A Popularity-Based Prediction Model for Web Prefetching , 2003, Computer.

[9]  Wei Lin,et al.  Web prefetching between low-bandwidth clients and proxies: potential and performance , 1999, SIGMETRICS '99.

[10]  Ian H. Witten,et al.  Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..

[11]  Arun Venkataramani,et al.  The potential costs and benefits of long-term prefetching for content distribution , 2002, Comput. Commun..

[12]  Darrell D. E. Long,et al.  Exploring the Bounds of Web Latency Reduction from Caching and Prefetching , 1997, USENIX Symposium on Internet Technologies and Systems.

[13]  Arun Venkataramani,et al.  NPS: A Non-Interfering Deployable Web Prefetching System , 2003, USENIX Symposium on Internet Technologies and Systems.

[14]  Themistoklis Palpanas,et al.  Web prefetching using partial match prediction , 1998 .

[15]  Martin F. Arlitt,et al.  Web server workload characterization: the search for invariants , 1996, SIGMETRICS '96.

[16]  Arun Venkataramani,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tcp Nice: a Mechanism for Background Transfers , 2022 .

[17]  Randy H. Katz,et al.  Clustering Web content for efficient replication , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[18]  Dan Duchamp,et al.  Prefetching Hyperlinks , 1999, USENIX Symposium on Internet Technologies and Systems.