About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Performance study of a collaborative method for hierarchical caching in proxy servers
Abstract
With the increasing popularity of the World Wide Web, it is desirable to store copies of popular documents in client and proxy caches and thus reduce the network delay times for URL requests. In this paper we study the caching problem for Web documents in a hierarchy of collaborating proxy servers. Specifically, the focus of our work is to reduce duplicate caching between a proxy and its parent or higher level proxies in the hierarchy when making a caching decision. A collaboration protocol passes caching decision information along with the object to the next lower level proxy to facilitate its caching decision. We analyze the performance of the collaborative method and the conventional method by means of event driven simulation. The collaborative approach is found to provide a much more effective use of the caching resource. Various sensitivity analyses have been conducted. This result is found to be relatively insensitive to the nature of the workloads. © 1998 Published by Elsevier Science B.V. All rights reserved.
Related
Conference paper
The Link Regression Problem in Graph Streams
Conference paper