Access Strategies for Network Caching

Cohen, Itamar; Einziger, Gil; Friedman, Roy; Scalosub, Gabriel

doi:10.1109/infocom.2019.8737427

Cited by 13 publications

(35 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the study in [1] shows that indicators may degrade the performance in some scenarios in what is refer to as the "Bloom Paradox". The works [26]- [28] tackle a distributed scenario where multiple caches send indicators, and the client needs to formulate an access strategy that minimizes the total expected cost. The work of [29] suggests methods to reduce the transmission overheads of indicators, at the expense of larger local memory consumption.…”

Section: Related Workmentioning

confidence: 99%

“…The service cost is the sum of the cache access cost, and the miss penalty cost. To make a meaningful comparison of performance, we focus our attention on the average service cost of all the requests in the sequence, thus following similar cost models studied in previous works [26], [28], [35].…”

Section: System Modelmentioning

confidence: 99%

“…Looking into the future, we plan to develop access strategies that cope well with false-negatives, and then use such strategies alongside CAB on a distributed network. Such work may borrow ideas from [26], [32] in developing improved solutions for distributed cache access with advertisements.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints

Cohen¹,

Einziger²,

Scalosub³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Cache advertisements reduce the access cost by allowing users to skip the cache when it does not contain their datum. Such advertisements are used in multiple networked domains such as 5G networks, wide area networks, and informationcentric networking. The selection of an advertisement strategy exposes a trade-off between the access cost and bandwidth consumption. Still, existing works mostly apply a trial-anderror approach for selecting the best strategy, as the rigorous foundations required for optimizing such decisions is lacking.Our work shows that the desired advertisement policy depends on numerous parameters such as the cache policy, the workload, the cache size, and the available bandwidth. In particular, we show that there is no ideal single configuration. Therefore, we design an adaptive, self-adjusting algorithm that periodically selects an advertisement policy. Our algorithm does not require any prior information about the cache policy, cache size, or workload, and does not require any apriori configuration. Through extensive simulations, using several state-of-the-art cache policies, and real workloads, we show that our approach attains a similar cost to that of the best static configuration (which is only identified in retrospect) in each case.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints

Cohen¹,

Einziger²,

Scalosub³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…For instance, [19] focuses on updating the placement in order to react to traffic changes, and [20] deals with the parallelization opportunities offered by VNF graphs. Other works [10], [21] focus on the choice between MEC-and cloud-based computation resources, while [8] studies which cache storage (i.e., MECor cloud-based) to access, balancing miss probability and cost.…”

Section: Related Workmentioning

confidence: 99%

OKpi: All-KPI Network Slicing Through Efficient Resource Allocation

Martín‐Pérez

Malandrino

Chiasserini

et al. 2020

IEEE INFOCOM 2020 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Networks can now process data as well as transporting it; it follows that they can support multiple services, each requiring different key performance indicators (KPIs). Because of the former, it is critical to efficiently allocate network and computing resources to provide the required services, and, because of the latter, such decisions must jointly consider all KPIs targeted by a service. Accounting for newly introduced KPIs (e.g., availability and reliability) requires tailored models and solution strategies, and has been conspicuously neglected by existing works, which are instead built around traditional metrics like throughput and latency. We fill this gap by presenting a novel methodology and resource allocation scheme, named OKpi, which enables high-quality selection of radio points of access as well as VNF (Virtual Network Function) placement and data routing, with polynomial computational complexity. OKpi accounts for all relevant KPIs required by each service, and for any available resource from the fog to the cloud. We prove several important properties of OKpi and evaluate its performance in two realworld scenarios, finding it to closely match the optimum.

show abstract

“…Consequently, the problem of advertising space-efficient indicators while keeping a low falsepositive rate has attracted a bulk of research effort [7], [9]- [11], [13]. Other works addressed the cache selection problem, namely, selecting which cache to access when there exist one (or more) several positive indications, where some of them may actually be false-positives [7], [14].…”

Section: Introductionmentioning

confidence: 99%

On the Power of False Negative Awareness in Indicator-based Caching Systems

Cohen¹,

Einziger²,

Scalosub³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Distributed caching systems such as content distribution networks often advertise their content via lightweight approximate indicators (e.g., Bloom filters) to efficiently inform clients where each datum is likely cached. While false-positive indications are necessary and well understood, most existing works assume no false-negative indications. Our work illustrates practical scenarios where false-negatives are unavoidable and ignoring them has a significant impact on system performance. Specifically, we focus on false-negatives induced by indicator staleness, which arises whenever the system advertises the indicator only periodically, rather than immediately reporting every change in the cache. Such scenarios naturally occur, e.g., in bandwidthconstraint environments or when latency impedes each client's ability to obtain an updated indicator.Our work introduces novel false-negative aware access policies that continuously estimate the false-negative ratio and sometimes access caches despite negative indications. We present optimal policies for homogeneous settings and provide approximation guarantees for our algorithms in heterogeneous environments. We further perform an extensive simulation study with multiple real system traces. We show that our false-negative aware algorithms incur a significantly lower access cost than existing approaches or match the cost of these approaches while requiring an order of magnitude fewer resources (e.g., caching capacity or bandwidth).

show abstract

Access Strategies for Network Caching

Cited by 13 publications

References 22 publications

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints

OKpi: All-KPI Network Slicing Through Efficient Resource Allocation

On the Power of False Negative Awareness in Indicator-based Caching Systems

Contact Info

Product

Resources

About