Web Proxy Cache Replacement: Do's, Don'ts, and Expectations

Numerous research efforts have produced a large number of algorithms and mechanisms for web proxy caches. In order to build powerful web proxies and understand their performance, one must be able to appreciate the impact and significance of earlier contributions and how they can be integrated. To do this we employ a cache replacement algorithm, ‘CSP’, which integrates key knowledge from previous work. CSP utilizes the communication Cost to fetch web objects, the objects’ Sizes, their Popularities, an auxiliary cache and a cache admission control algorithm. We study the impact of these components with respect to hit ratio, latency, and bandwidth requirements. Our results show that there are clear performance gains when utilizing the communication cost, the popularity of objects, and the auxiliary cache. In contrast, the size of objects and the admission controller have a negligible performance impact. Our major conclusions going against those in related work are that (i) LRU is p...

• Type: Conference
• Year: 2003
• Where: NCA
• Authors: Peter Triantafillou, Ioannis Aekaterinidis
• Keywords: Auxiliary Cache, Cache Replacement Algorithm, NCA 2003, Network Computing, Replacement Algorithm