A Utility Optimization Approach to Network Cache Design

Abstract

In any caching system, the admission and eviction policies determine which contents are added and removed from a cache when a miss occurs. Usually, these policies are devised so as to mitigate staleness and increase the hit probability. Nonetheless, the utility of having a high hit probability can vary across contents. This occurs, for instance, when service level agreements must be met, or if certain contents are more difficult to obtain than others. In this paper, we propose utility-driven caching, where we associate with each content a utility, which is a function of the corresponding content hit probability. We formulate optimization problems where the objectives are to maximize the sum of utilities over all contents. These problems differ according to the stringency of the cache capacity constraint. Our framework enables us to reverse engineer classical replacement policies such as LRU and FIFO, by computing the utility functions that they maximize. We also develop online algorithms that can be used by service providers to implement various caching policies based on arbitrary utility functions.

IEEE INFOCOM 2016

References in corpus (2)

• A versatile and accurate approximation for LRU cache performance
• A Utility Optimization Approach to Network Cache Design

Cited by in corpus (15)

• A Utility Optimization Approach to Network Cache Design
• Resilient Primal-Dual Optimization Algorithms for Distributed Resource Allocation
• Biases in the Facebook News Feed: a Case Study on the Italian Elections
• Fairness in Online Social Network Timelines: Measurements, Models and Mechanism Design
• Search and Placement in Tiered Cache Networks
• A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
• On Optimal Geographical Caching in Heterogeneous Cellular Networks
• Optimized Dynamic Cache Instantiation and Accurate LRU Approximations under Time-varying Request Volume
• Q-caching: an integrated reinforcement-learning approach for caching and routing in information-centric networks
• Worst-case Bounds and Optimized Cache on $M^{th}$ Request Cache Insertion Policies under Elastic Conditions
• Sharing LRU Cache Resources among Content Providers: A Utility-Based Approach
• MinDelay: Low-latency Forwarding and Caching Algorithms for Information-Centric Networks
• A TTL-based Approach for Content Placement in Edge Networks
• How often should I access my online social networks?
• Soft-TTL: Time-Varying Fractional Caching