Performance Study of Satellite-Linked Web Caches and Filtering Policies

The exponential growth of World-Wide Web (WWW) requires new and more efficient content distribution mechanisms. Web caching has shown to be a very efficient way to scale the WWW by reducing traffic in congested network links, decreasing latency to the clients, and reducing load in the origin servers. In this paper we study an emerging caching strategy called cache-satellite distribution. In a cache-satellite distribution caches are inter-connected via a satellite channel, effectively increasing the client population connected to a cache. Using Markov chain analysis, we demonstrate that the higher the number of clients connected to a cache-satellite distribution, the higher the probability that a document request is hit in the cache. Our analytical results strongly advocate a large scale interconnection and cooperation of ISP-caches via a satellite distribution. Due to the large amount of documents distributed through the satellite and the limited disk capacity and processing power of local ISP caches, it is impossible to store all documents coming from the satellite distribution. Therefore, it becomes necessary for an ISP-cache connected to the satellite distribution to perform efficient filtering policies. Based on the stability in the behavior of the clients of an ISP cache, we propose novel filtering policies which rely on the Web servers visited on the previous days. Using trace-driven simulation, we study different filtering policies and show how simple filtering policies can exhibit excellent performance in rejecting non-desired documents while assuring high hit rates.

[1]  Steffen Rothkugel,et al.  World Wide Web caching: the application-level view of the Internet , 1997, IEEE Commun. Mag..

[2]  George Kingsley Zipf,et al.  Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology , 2012 .

[3]  Alex Rousskov,et al.  On performance of caching proxies (extended abstract) , 1998, SIGMETRICS '98/PERFORMANCE '98.

[4]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[5]  Tim Berners-Lee,et al.  Hypertext transfer protocol--http/i , 1993 .

[6]  Keith Ross,et al.  Cache Array Routing Protocol v1.1 , 1998 .

[7]  Eric A. Brewer,et al.  System Design Issues for Internet Middleware Services: Deductions from a Large Client Trace , 1997, USENIX Symposium on Internet Technologies and Systems.

[8]  Roy T. Fielding,et al.  Hypertext Transfer Protocol - HTTP/1.0 , 1996, RFC.

[9]  G. Zipf,et al.  Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. , 1949 .

[10]  Pablo Rodriguez,et al.  Bringing the Web to the Network Edge: Large Caches and Satellite Distribution , 2002, Mob. Networks Appl..

[11]  V. Jacobson,et al.  Adaptive Web Caching , 1997 .

[12]  Roy Fielding RFC 2068 : Hypertext Transfer Protocol-HTTP/1.1 , 1997 .

[13]  CachingLee,et al.  On the Implications of Zipf ' s Law for Web , 1998 .

[14]  Yuen Ren Chao,et al.  Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology , 1950 .

[15]  Peter B. Danzig,et al.  A Hierarchical Internet Object Cache , 1996, USENIX ATC.

[16]  Roy T. Fielding,et al.  Hypertext Transfer Protocol - HTTP/1.1 , 1997, RFC.

[17]  Michael Dahlin,et al.  Design considerations for distributed caching on the Internet , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[18]  Duane Wessels,et al.  Application of Internet Cache Protocol (ICP), version 2 , 1997, RFC.

[19]  Alex Rousskov On Performance of Caching Proxies , 1998, SIGMETRICS 1998.

[20]  Keith W. Ross,et al.  Hash routing for collections of shared Web caches , 1997, IEEE Netw..

[21]  Anja Feldmann,et al.  Rate of Change and other Metrics: a Live Study of the World Wide Web , 1997, USENIX Symposium on Internet Technologies and Systems.