Darwin: Flexible Learning-based CDN Caching-Reference-Cited by-同舟云学术

Darwin: Flexible Learning-based CDN Caching

Published:2023-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM SIGCOMM 2023 Conference
language:
Short-container-title:

Author:

Chen Jiayi¹^ORCID,Sharma Nihal²^ORCID,Khan Tarannum²^ORCID,Liu Shu³^ORCID,Chang Brian¹^ORCID,Akella Aditya¹^ORCID,Shakkottai Sanjay¹^ORCID,Sitaraman Ramesh K⁴^ORCID

Affiliation:

1. The University of Texas at Austin, Austin, United States of America

2. The University of Texas at Austin, Austin, USA

3. University of California, Berkeley, Berkeley, United States of America

4. University of Massachusetts Amherst and Akamai Technologies, Amherst, United States of America

Funder

CNS

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3603269.3604863

Reference52 articles.

1. Amin , K. , Kearns , M. , and Syed , U . Graphical models for bandit problems. arXiv preprint arXiv:1202.3782 ( 2012 ). Amin, K., Kearns, M., and Syed, U. Graphical models for bandit problems. arXiv preprint arXiv:1202.3782 (2012).

2. Ari , I. , Amer , A. , Gramacy , R. B. , Miller , E. L. , Brandt , S. A. , and Long , D. D . Acme: Adaptive caching using multiple experts . In WDAS ( 2002 ), vol. 2 , pp. 143 -- 158 . Ari, I., Amer, A., Gramacy, R. B., Miller, E. L., Brandt, S. A., and Long, D. D. Acme: Adaptive caching using multiple experts. In WDAS (2002), vol. 2, pp. 143--158.

3. Asiso . Overview of the cdn akamai. https://www.asioso.com/en/blog/overview-of-the-cdn-akamai-b520 , Feb 2021 . Asiso. Overview of the cdn akamai. https://www.asioso.com/en/blog/overview-of-the-cdn-akamai-b520, Feb 2021.

4. Atsidakou , A. , Papadigenopoulos , O. , Caramanis , C. , Sanghavi , S. , and Shakkottai , S . Asymptotically-optimal gaussian bandits with side observations . In International Conference on Machine Learning ( 2022 ), PMLR, pp. 1057 -- 1077 . Atsidakou, A., Papadigenopoulos, O., Caramanis, C., Sanghavi, S., and Shakkottai, S. Asymptotically-optimal gaussian bandits with side observations. In International Conference on Machine Learning (2022), PMLR, pp. 1057--1077.

5. Randomized admission policy for efficient top-k and frequency estimation