skip to main content
research-article

Fair Caching Networks

Published: 05 March 2021 Publication History

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.

References

[1]
S. Ioannidis and E. Yeh, "Adaptive caching networks with optimality guarantees," ACM SIGMETRICS Performance Evaluation Review, vol. 44, no. 1, pp. 113--124, 2016.
[2]
Y. Liu, Y. Li, Q. Ma, S. Ioannidis, and E. Yeh, "Fair caching networks," Performance Evaluation, 2020. https://doi.org/10.1016/j.peva.2020.102138.
[3]
A. A. Ageev and M. I. Sviridenko, "Pipage rounding: A new method of constructing algorithms with proven performance guarantee," Journal of Combinatorial Optimization, vol. 8, no. 3, pp. 307--328, 2004.

Cited By

View all
  • (2023)Caching and NeutralityProceedings of the 22nd ACM Workshop on Hot Topics in Networks10.1145/3626111.3628211(63-69)Online publication date: 28-Nov-2023
  • (2023)Jointly Optimal Routing and Caching with Bounded Link CapacitiesICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279235(1130-1136)Online publication date: 28-May-2023
  • (2023)Resource Allocation in Multi-access Edge Computing for 5G-and-beyond networksComputer Networks10.1016/j.comnet.2023.109720227(109720)Online publication date: May-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 48, Issue 3
December 2020
140 pages
ISSN:0163-5999
DOI:10.1145/3453953
Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 March 2021
Published in SIGMETRICS Volume 48, Issue 3

Check for updates

Author Tags

  1. caching network
  2. fairness
  3. resource allocation

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)20
  • Downloads (Last 6 weeks)2
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Caching and NeutralityProceedings of the 22nd ACM Workshop on Hot Topics in Networks10.1145/3626111.3628211(63-69)Online publication date: 28-Nov-2023
  • (2023)Jointly Optimal Routing and Caching with Bounded Link CapacitiesICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279235(1130-1136)Online publication date: 28-May-2023
  • (2023)Resource Allocation in Multi-access Edge Computing for 5G-and-beyond networksComputer Networks10.1016/j.comnet.2023.109720227(109720)Online publication date: May-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media