Variable Qos from Shared Web Caches: User-Centered Design and Value-Sensitive Replacement

Abstract
Due to differences in server capacity, exter- nal 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 gen- erate maximum aggregate value for servers. We consider both the prediction and value aspects of this problem and in- troduce a novel value-sensitive LFU/LRU hybrid which bi- ases 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 associ- ated with obtaining servers' private valuation information.

This publication has 16 references indexed in Scilit: