Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.peva.2018.09.011
Title: Weighted fair caching: Occupancy-centric allocation for space-shared resources
Authors: Shi, Lianjie
WANG XIN 
Ma Tianbai 
TAY YONG CHIANG 
Keywords: Science & Technology
Technology
Computer Science, Hardware & Architecture
Computer Science, Theory & Methods
Computer Science
Caching policy
Occupancy rate
Resource allocation
Issue Date: 25-Jan-2019
Publisher: ELSEVIER SCIENCE BV
Citation: Shi, Lianjie, WANG XIN, Ma Tianbai, TAY YONG CHIANG (2019-01-25). Weighted fair caching: Occupancy-centric allocation for space-shared resources. Performance Evaluation Review 46 (3) : Performance Evaluation Review. ScholarBank@NUS Repository. https://doi.org/10.1016/j.peva.2018.09.011
Abstract: © 2018 Elsevier B.V. Traditional cache replacement policies such as LRU and LFU were often designed with the focus on efficiency and aimed at maximizing the hit rates. However, the resource owners of modern computing systems such as cloud infrastructures and content delivery networks often have new objectives such as fairness and revenue to be optimized rather than the overall hit rate. A general resource management framework that allows resource owners to determine various resource allocations is desirable. Although such a mechanism like Weighted Fair Queueing (WFQ) exists for indivisible time-shared resources such as CPU and network bandwidth, no such counterpart exists for space-shared resources such as cache and main memory. 1 In this paper, we propose Weighted Fair Caching (WFC), a capacity-driven cache policy that provides explicitly tunable resource allocations for cache owners in terms of the occupancy rates of contents. Through analysis of the continuous-time Markov Chain model of cache dynamics, we derive the closed-form occupancy rates as a function of the weights of contents, and various properties such as monotonicity and scaling of WFC. We show that WFC can be used to provide fair sharing of cache space among contents, as well as class-based service differentiations. We evaluate the performance of WFC using real data traces from two major video providers. We find that, compared to traditional cache policies, WFC provides better fairness while sacrificing an acceptable amount of hit rates.
Source Title: Performance Evaluation Review
URI: https://scholarbank.nus.edu.sg/handle/10635/156948
ISSN: 0166-5316
1872-745X
DOI: 10.1016/j.peva.2018.09.011
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
p35-shi.pdfPublished version1.03 MBAdobe PDF

OPEN

PublishedView/Download

Page view(s)

27
checked on Oct 10, 2019

Download(s)

1
checked on Oct 10, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.