Abstract
Caching at proxy servers plays an important role in reducing the latency of the user response, the network delays and the load on Web servers. The cache performance depends critically on the design of the cache replacement algorithm. Unfortunately, most cache replacement algorithms ignore the Web's scale. In this paper we argue for the design of delay-conscious cache replacement algorithms which explicitly consider the Web's scale by preferentially caching documents which require a long time to fetch to the cache. We present a new, delay-conscious cache replacement algorithm LNC-R-W3 which maximizes a performance metric called delay-savings-ratio. Subsequently, we test the performance of LNC-R-W3 experimentally and compare it with the performance of other existing cache replacement algorithms, namely LRU and LRU-MIN.
Original language | English (US) |
---|---|
Pages (from-to) | 997-1005 |
Number of pages | 9 |
Journal | Computer Networks |
Volume | 29 |
Issue number | 8-13 |
DOIs | |
State | Published - 1997 |
Keywords
- Cache replacement
- Client-server architecture
- Proxy servers
- Trace-driven simulation
ASJC Scopus subject areas
- Computer Networks and Communications