Deep Blue
Deep Blue

Deep Blue at the University of Michigan > Research Collections > Information, School of (SI) >

Please use this persistent URL to cite or link to this item:
http://hdl.handle.net/2027.42/60420 ◀ bookmark this

Title: Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value
Authors: MacKie-Mason, Jeffrey K.
Kelly, Terence P.
Chan, Yee Man
Jamin, Sugih
Issue Date: 1999
Citation: Proceedings of the Fourth International Web Caching Workshop, San Diego, CA, March 31-April 2, 1999 (refereed) <http://hdl.handle.net/2027.42/60420>
Abstract: 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.
Appears in Collections:Information, School of (SI)
Electrical Engineering and Computer Science, Department of (EECS)
Public Policy, Gerald R. Ford School of

Files in This Item:

File Description SizeFormat 
weighted-lfu.pdf272KbAdobe PDFView/Open

Deep Blue encourages the fair use of copyrighted material, and you are free to link to content here without asking for permission. Consult the document(s) and/or contact the copyright holder for additional rights questions and requests.