article · 2024

A Randomized Caching Algorithm for Distributed Data Access

Cited by 1Abstract and details only

Abstract

In this paper, we study an online cost optimization problem for distributed data access. The goal of this problem is to dynamically create and delete data copies in a multi-server distributed system as time goes, in order to minimize the total storage and network cost of serving access requests. We propose an online algorithm with randomized storage periods of data copies in the servers, and derive an optimal probability density function of storage periods, which makes the algorithm achieve a competitive ratio of $1 + \frac{{\sqrt 2 }}{2}$. An example is presented to show that the competitive analysis of our algorithm is tight. Experimental evaluations using real data access traces demonstrate that our algorithm outperforms the best known deterministic algorithm.

Cite this paper

APA 7

Zuo, T., Tang, X., & Lee, B. (2024). A Randomized Caching Algorithm for Distributed Data Access. https://doi.org/10.1109/infocom52122.2024.10621329

MLA 9

Zuo, Tianyu, et al. “A Randomized Caching Algorithm for Distributed Data Access.” 2024, pp. 851–60, https://doi.org/10.1109/infocom52122.2024.10621329.

Chicago

Zuo, Tianyu, Xueyan Tang, and Bu‐Sung Lee. 2024. “A Randomized Caching Algorithm for Distributed Data Access.” https://doi.org/10.1109/infocom52122.2024.10621329.

Harvard

Zuo, T., Tang, X. and Lee, B. (2024) ‘A Randomized Caching Algorithm for Distributed Data Access’. Available at: https://doi.org/10.1109/infocom52122.2024.10621329.

BibTeX

@article{zuo2024randomized,
  title = {{A Randomized Caching Algorithm for Distributed Data Access}},
  author = {Zuo, Tianyu and Tang, Xueyan and Lee, Bu‐Sung},
  pages = {851--860},
  year = {2024},
  doi = {10.1109/infocom52122.2024.10621329}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.