Fair Caching Networks
- 5 March 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 48 (3), 89-90
- https://doi.org/10.1145/3453953.3453973
Abstract
We study fair content allocation strategies in caching networks through a utility-driven framework, where each request achieves a utility of its caching gain rate. The resulting problem is NP-hard. Submodularity allows us to devise a deterministic allocation strategy with an optimality guarantee factor arbitrarily close to 1-1/e. When 0 < α ≤ 1, we further propose a randomized strategy that attains an improved optimality guarantee, (1 - 1/e)1-α, in expectation. Through extensive simulations over synthetic and real-world network topologies, we evaluate the performance of our proposed strategies and discuss the effect of fairness.Keywords
This publication has 2 references indexed in Scilit:
- Adaptive Caching Networks with Optimality GuaranteesACM SIGMETRICS Performance Evaluation Review, 2016
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance GuaranteeJournal of Combinatorial Optimization, 2004