Abstract: Belady's algorithm is optimal but infeasible because it requires knowledge of the future. This paper explains how a cache replacement algorithm can nonetheless learn from Belady's algorithm ...

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, ...

A simulator for CDN caching and web caching policies. Simulate a variety of existing caching policies by replaying request traces, and use this framework as a basis to experiment with new ones. A ...