J. Dilley, M. Arlitt, Improving Proxy Cache Performance:Analysis of three Replacement Policies, IEEE Internet Computing, Nov/Dec 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....caches, loadbalancing of cache clusters, distributing traffic between caches sites, backup fail over policies, and managing performance for service level agreements. The behavior of a distributed system with many clients, servers, and networks depends heavily on the characteristics of its workload [2,6,8,12,13,14,16]. Thus, one of the first steps in any performance evaluation study is to understand the workload by extracting key characteristics from actual Web workloads. In order to analyze distributions of important parameters such as file size from workload sources or evaluate the accuracy of a synthetic ....

J. Dilley, M. Arlitt, Improving Proxy Cache Performance:Analysis of three Replacement Policies, IEEE Internet Computing, Nov/Dec 1999.

....can be improved by reusing previously cached results for a new query. In the context of Web services, data caching and Web proxies have been shown to speed up servicing web requests by caching popular pages, only performing remote transactions when requests cannot be satisfied from the cache [10, 20]. AGrid based environment, which consists of a collection of compute, memory, and storage systems (i.e. shared and distributed memory parallel machines, high end I O systems, and active disk based storage systems) offers a powerful and flexible environment for developing and deploying ....

J. Dilley and M. Arlitt. Improving proxy cache performance: Analysis of three replacement policies. IEEE Internet Computing, 3(6):44--50, November/December.

....is another optimization that can be applied to improve system performance. In the context of Web services, data caching and Web proxies have been shown to speed up servicing web requests by caching popular pages, only performing remote transactions when requests cannot be satisfied from the cache [8, 17]. A grid based cluster environment, which consists of a collection of compute, memory, and storage systems (i.e. shared and distributed memory parallel machines, highend I O systems, and active disk based storage systems) offers a powerful and flexible environment for developing and deploying ....

J. Dilley and M. Arlitt. Improving proxy cache performance: Analysis of three replacement policies. 1EEE Internet Computing, 3(6):44 50, November/December.

....this is a concern that has permeated the research specifically taking into consideration the cost of retrieving an object that was evicted from the cache. Cao and Irani [11] present a caching algorithm that incorporates locality as well as cost and size as parameters for eviction. Arlitt et al. [5, 18] expand on this work by conducting a performance evaluation of web proxy replacement policies and suggest policies that are geared towards keeping more popular and smaller objects in cache. Although we have formulated our issue as a cache replacement policy, the fact that intermediate results ....

J. Dilley and M. Arlitt. Improving proxy cache performance: Analysis of three replacement policies. 3(6):44--50, November /December.

....interface between a single web server and all of its users. It reduces the number of requests the server must handle, and then helps load balancing, scalability and availability. In all cases, it is recognized that deploying caching in the world wide web can improve the net trac in several ways [1,3,6,7,14,21,23,24,33,36,39,46,47], including the reduction of bandwidth consumption, network latency and server load. Web caching, however, poses some issues which risk to reduce its applicability and e ectiveness. We mention the issues of cache consistency [13] cached copies may become stale) dynamic objects [15] e.g. web ....

....is a simple on line estimation of 0 T . Of course, the ORCL strategy can be simulated only on historical data, since we need to know future requests in order to compute 0 T . Many other algorithms can be found in literature, very similar to or extending the schema of the above strategies [2,3,14,20,21,23,28,29,33,36,39,46]. Also, we refer to [5,8] for the state of the art in theoretical complexity analysis of on line and o line caching strategies. However, we notice that all such approaches and re nements are all of a static nature, since they follow some xed criteria usually originated from an a priori analysis ....

J. Dilley and M.F. Arlitt, Improving proxy cache performance: Analysis of three replacement policies, IEEE Internet Computing 3 (1999) 44-50.

....times of the same three sites from 47 different mirrors was stable [10] Caching has been widely studied as a means for enhancing performance in the Internet during the 1990 s. These studies include cache traffic evaluation [11] 12] replacement algorithm BARFORD, CAI, GAST 3 performance [13] [14], cache hierarchy architecture [15] 16] and cache appliance design [17] 18] A number of recent papers have addressed the issue of proxy placement based on assumptions about the underlying topological structure of the Internet [3] 19] 20] In [3] Li et al. describe an optimal dynamic ....

J. Dilly and M. Arlitt, "Improving proxy cache performance: Analysis of three replacement policies," IEEE Internet Computing, vol. 3(6), November 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC