Disk space in shared Web caches can be diverted to serve some system users at the expense of others. Cache hits reduce server loads, and if servers desire load reduction to different degrees, a replacement policy which prioritizes cache space across servers can provide differential quality-of-service (QoS). We present a simple generalization of least-frequently-used (LFU) replacement that is sensitive to varying levels of server valuation for cache hits. Through trace-driven simulation we show that under a particular assumption about server valuations our algorithm delivers a reasonable QoS relationship: higher byte hit rates for servers that value hits more. We furthermore adopt the economic perspective that value received by system users is a more appropriate performance metric than hit rate or byte hit rate, and demonstrate that our algorithm delivers higher "social welfare" (aggregate value to servers) than LRU or LFU.
In the context of web caching, Kelly et al. REF proposed a biased replacement policy for web caches to implement differentiated quality-of-service (QoS) by prioritizing cache space to servers.
Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value
In Fourth International Web Caching Workshop
Computer Science