Hint-based acceleration of Web proxy caches

Numerous studies show that proxy cache miss ratios are typically at least 40%-50%. This paper proposes and evaluates a new approach for improving the throughput of proxy caches by reducing cache miss overheads. An embedded system able to achieve significantly better communications performance than a traditional proxy filters the requests directed to a proxy cache, forwarding the hits to the proxy and processing the misses itself. This system, called a Proxy Accelerator, uses hints of the proxy cache content and may include a main memory cache for the hottest objects. Scalability with the Web proxy cluster size is achieved by using several accelerators. We use analytical models and trace-based simulations to study the benefits and the implementation tradeoffs of this new approach. A single proxy accelerator node in front of a four-node Web proxy improves the cost-performance ratio by about 40%. Implementation choices that do not affect the overall hit ratio are available.

[1]  Duane Wessels,et al.  The First IRCache Web Cache Bake-off , 1999 .

[2]  Eric Levy-Abegnoli,et al.  Design and performance of a Web server accelerator , 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).

[3]  Li Fan,et al.  Summary cache: a scalable wide-area Web cache sharing protocol , 1998, SIGCOMM '98.

[4]  Abdelsalam ‘Solom’ Heddaya.  DynaCache : Weaving Caching into the Internet , 1998 .

[5]  Michael J. Feeley,et al.  The Measured Access Characteristics of World-Wide-Web Client Proxy Caches , 1997, USENIX Symposium on Internet Technologies and Systems.

[6]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[7]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[8]  Syam Gadde,et al.  Not all Hits are Created Equal: Cooperative Proxy Caching Over a Wide-Area Network , 1998, Comput. Networks.

[9]  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).

[10]  Jeffrey C. Mogul,et al.  Scalable Kernel Performance for Internet Servers Under Realistic Loads , 1998, USENIX Annual Technical Conference.

[11]  Anja Feldmann,et al.  Performance of Web proxy caching in heterogeneous bandwidth environments , 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]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[13]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

[14]  Michael RabinovichAT,et al.  A Taste of Crispy Squid , 1998 .

[15]  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.

[16]  Erich M. Nahum,et al.  Locality-aware request distribution in cluster-based network servers , 1998, ASPLOS VIII.