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

by   Itamar Cohen, et al.

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 bandwidth-constraint environments or when latency impedes the ability of each client 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).


False Negative Awareness in Indicator-based Caching Systems

Distributed caching systems such as content distribution networks often ...

Soft Cache Hits and the Impact of Alternative Content Recommendations on Mobile Edge Caching

Caching popular content at the edge of future mobile networks has been w...

Keep-Alive Caching for the Hawkes process

We study the design of caching policies in applications such as serverle...

Similarity Caching: Theory and Algorithms

This paper focuses on similarity caching systems, in which a user reques...

Analytical approach to network inference: Investigating degree distribution

When the network is reconstructed, two types of errors can occur: false ...

Sample-Efficient Safety Assurances using Conformal Prediction

When deploying machine learning models in high-stakes robotics applicati...

RetroRenting: An Online Policy for Service Caching at the Edge

The rapid proliferation of shared edge computing platforms has enabled a...

Please sign up or login with your details

Forgot password? Click here to reset