Proxy prefetch and prefix caching

Proxy prefetch caching aims to reduce the latency in serving web requests by prefetching objects into the proxy cache in anticipation that they might be requested. Thus, when the clients actually request them, these objects can be served directly from the proxy cache without having to be fetched all the way from the remote server. A key component in proxy prefetch caching is the mechanism to determine the profitability of prefetching. A good prefetch advisor must consider not only factors such as the request probability of the prefetched objects, the network bandwidth, and object size, but also the cache space and those objects already in the cache. A unified framework is therefore needed, under which the prefetch advisor can judge whether prefetching some objects by replacing some other objects in the cache can lead to a reduction in the average user access time. In this paper we introduce a framework that unifies prefetch caching and cache replacement with a single index called object profit. The proposed framework is very general that it can be applied to almost any type of web objects, and it considers network bandwidth, cache capacity and replacement, object size, and analysis simplicity together. We will derive the object profit mathematically and then discuss how to apply the framework in practice. The proposed scheme is evaluated with simulation. As the simulation shows, the latency reduction by using the proposed framework can be maximized.

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

[2]  Shunzheng Yu,et al.  A new prefetch cache scheme , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[3]  Vaduvur Bharghavan,et al.  Alleviating the Latency and Bandwidth Problems in WWW Browsing , 1997, USENIX Symposium on Internet Technologies and Systems.

[4]  Anja Feldmann,et al.  Measurement and analysis of IP network usage and behavior , 2000, IEEE Commun. Mag..

[5]  P. Billingsley,et al.  Probability and Measure , 1980 .

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

[7]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[8]  Dennis Strelow,et al.  Reducing Web latency with hierarchical cache-based prefetching , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[9]  Carlos R. Cunha,et al.  Determining WWW user's next access and its application to pre-fetching , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

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

[11]  Donald F. Towsley,et al.  Proxy prefix caching for multimedia streams , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  Evangelos P. Markatos,et al.  A top- 10 approach to prefetching on the web , 1996 .

[13]  Leonard Kleinrock,et al.  Prefetching links on the WWW , 1997, Proceedings of ICC'97 - International Conference on Communications.

[14]  L. E. Clarke,et al.  Probability and Measure , 1980 .

[15]  Edith Cohen,et al.  Prefetching the means for document transfer: a new approach for reducing Web latency , 2002, Comput. Networks.

[16]  Azer Bestavros,et al.  Using speculation to reduce server load and service time on the WWW , 1995, CIKM '95.