Optimizing Replacement Policies for Content Delivery Network Caching: Beyond Belady to Attain A Seemingly Unattainable Byte Miss Ratio

by   Peng Wang, et al.

When facing objects/files of differing sizes in content delivery networks (CDNs) caches, pursuing an optimal object miss ratio (OMR) by approximating Belady no longer ensures an optimal byte miss ratio (BMR), creating confusion about how to achieve a superior BMR in CDNs. To address this issue, we experimentally observe that there exists a time window to delay the eviction of the object with the longest reuse distance to improve BMR without increasing OMR. As a result, we introduce a deep reinforcement learning (RL) model to capture this time window by dynamically monitoring the changes in OMR and BMR, and implementing a BMR-friendly policy in the time window. Based on this policy, we propose a Belady and Size Eviction (LRU-BaSE) algorithm, reducing BMR while maintaining OMR. To make LRU-BaSE efficient and practical, we address the feedback delay problem of RL with a two-pronged approach. On the one hand, our observation of a rear section of the LRU cache queue containing most of the eviction candidates allows LRU-BaSE to shorten the decision region. On the other hand, the request distribution on CDNs makes it feasible to divide the learning region into multiple sub-regions that are each learned with reduced time and increased accuracy. In real CDN systems, compared to LRU, LRU-BaSE can reduce "backing to OS" traffic and access latency by 30.05% and 17.07%, respectively, on average. The results on the simulator confirm that LRU-BaSE outperforms the state-of-the-art cache replacement policies, where LRU-BaSE's BMR is 0.63% and 0.33% less than that of Belady and Practical Flow-based Offline Optimal (PFOO), respectively, on average. In addition, compared to Learning Relaxed Belady (LRB), LRU-BaSE can yield relatively stable performance when facing workload drift.


page 1

page 4

page 8

page 10

page 11

page 12


Online Caching and Coding at the WiFi Edge: Gains and Tradeoffs

Video content delivery at the wireless edge continues to be challenged b...

Tradeoff between Ergodic Rate and Delivery Latency in Fog Radio Access Networks

Wireless content caching has recently been considered as an efficient wa...

Learning to Code: Coded Caching via Deep Reinforcement Learning

We consider a system comprising a file library and a network with a serv...

Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning

We consider in this work Edge Computing (EC) in a multi-tenant environme...

Caching with Time Domain Buffer Sharing

In this paper, storage efficient caching based on time domain buffer sha...

Online Reinforcement Learning of X-Haul Content Delivery Mode in Fog Radio Access Networks

We consider a Fog Radio Access Network (F-RAN) with a Base Band Unit (BB...

Lightweight Robust Size Aware Cache Management

Modern key-value stores, object stores, Internet proxy caches, as well a...

Please sign up or login with your details

Forgot password? Click here to reset