IEEE INFOCOM 2018 - IEEE Conference on Computer Communications 2018
DOI: 10.1109/infocom.2018.8485894
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing Replacement Policies in List-Based Caches with Non-Uniform Access Costs

Abstract: List-based caches can offer lower miss rates than single-list caches, but their analysis is challenging due to statespace explosion. Building upon recent theoretical results, we analyze in this setting randomized replacement policies subject to non-uniform access costs. In our model, costs can depend on the stream a request originated from, the target item, and the list that contains it. We first show that, similarly to the uniform-cost case, the random replacement (RR) and first-in first-out (FIFO) policies c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…Here, we consider more large-scale settings, compared to Section 4.2, that include up to 128 functions. The function popularity is controlled by different values of the Zipf parameter that are common in cache based studies [Cas18]. We consider all combinations of number of functions (N ), Zipf parameter (η) and arrival rate (λ).…”
Section: Model Validationmentioning
confidence: 99%
“…Here, we consider more large-scale settings, compared to Section 4.2, that include up to 128 functions. The function popularity is controlled by different values of the Zipf parameter that are common in cache based studies [Cas18]. We consider all combinations of number of functions (N ), Zipf parameter (η) and arrival rate (λ).…”
Section: Model Validationmentioning
confidence: 99%
“…Here, we consider more large-scale settings, compared to Section II, that include up to 128 functions. The function popularity is controlled by different values of the Zipf parameter that are common in cache based studies [21]. We consider all combinations of number of functions (N ), Zipf parameter (η) and arrival rate (λ).…”
Section: Model Validationmentioning
confidence: 99%
“…We have considered more large-scale settings compared to Section II that includes up to 128 functions. We have also considered different popularity parameters which are common in cache based studies [22]. We have considered each of the combinations of number of functions (N ), Zipf parameters(η) and arrival rates (λ) from the table.…”
Section: Model Validationmentioning
confidence: 99%