Skip to main content

Learning Relaxed Belady for Content Distribution Network Caching

Author(s): Song, Zhenyu; Berger, Daniel S; Li, Kai; Lloyd, Wyatt

To refer to this page use:
Abstract: This paper presents a new approach for caching in CDNs that uses machine learning to approximate the Belady MIN algorithm. To accomplish this complex task, we introduce the Relaxed Belady algorithm, the Belady boundary, and the good decision ratio that inform the design of Learning Relaxed Belady (LRB). LRB addresses the necessary system challenges to build an end-to-end machine learning caching prototype, including how to gather training data, limit memory overhead, and have lightweight training and inference paths. We implement an LRB simulator and a prototype within Apache Traffic Server. Our simulation using 6 production CDN traces show LRB reduces WAN traffic compared to a typical production CDN cache design by 5–24%, and consistently outperform other state-of-the-art methods. Our evaluation of the LRB prototype shows its overhead is modest and it can be deployed on today’s CDN servers.
Publication Date: 2020
Citation: Song, Zhenyu, Daniel S. Berger, Kai Li, Anees Shaikh, Wyatt Lloyd, Soudeh Ghorbani, Changhoon Kim et al. "Learning relaxed belady for content distribution network caching." In 17th USENIX Symposium on Networked Systems Design and Implementation (2020): pp. 529-544.
Pages: 529 - 544
Type of Material: Conference Article
Journal/Proceeding Title: 17th USENIX Symposium on Networked Systems Design and Implementation
Version: Final published version. Article is made available in OAR by the publisher's permission or policy.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.