Abstract

Due to differences in server capacity, external bandwidth, and client demand, some Web servers value cache hits more than others. Assuming that a shared cache knows the extent to which different servers value hits, it may employ a value-sensitive replacement policy in order to generate higher aggregate value for servers. We consider both the prediction and value aspects of this problem and introduce a novel value-sensitive LFU/LRU hybrid that biases the allocation of cache space toward documents whose origin servers value caching most highly. We compare our algorithm with others from the Web caching literature and discuss from an economic standpoint the problems associated with obtaining servers' private valuation information. 1 Introduction Since the inception of the World Wide Web, caching has helped to reduce server load, network traffic, and latency at the client end. However, among researchers no clear consensus exists on the relative importance of these goals or of related perfo...

Citations