A rolling-horizon dynamic programming approach for collaborative caching

07/31/2019
by   Xinan Yang, et al.
0

In this paper, we study the online collaborative content caching problem from network economics point of view. The network consists of small cell base stations (SCBSs) with limited cache capacity and a macrocell base station (MCBS). SCBSs are connected with their neighboring SCBSs through high-speed links and collaboratively decide what data to cache. Contents are placed at the SCBSs "free of charge" at off-peak hours and updated during the day according to the content demands by considering the network usage cost. We first model the caching optimization as a finite horizon Markov Decision Process that incorporates an auto-regressive model to forecast the evolution of the content demands. The problem is NP-hard and the optimal solution can be found only for a small number of base stations and contents. To allow derivation of close to optimal solutions for larger networks, we propose the rolling horizon method, which approximates future network usage cost by considering a small decision horizon. The results show that the rolling horizon approach outperforms comparison schemes significantly. Finally, we examine two simplifications of the problem to accelerate the speed of the solution: (a) we restrict the number of content replicas in the network and (b) we limit the allowed content replacements. The results show that the rolling horizon scheme can reduce the communication cost by over 84 (LRU) updates on offline schemes. The results also shed light on the tradeoff between the efficiency of the caching policy and the time needed to run the online algorithm.

READ FULL TEXT

page 1

page 12

research
01/01/2020

Optimal Scheduling of Content Caching Subject to Deadline

Content caching at the edge of network is a promising technique to allev...
research
02/19/2019

Distributed Network Caching via Dynamic Programming

Next-generation communication networks are envisioned to extensively uti...
research
09/01/2021

Decentralized Collaborative Video Caching in 5G Small-Cell Base Station Cellular Networks

We consider the problem of video caching across a set of 5G small-cell b...
research
10/31/2022

Caching Contents with Varying Popularity using Restless Bandits

Mobile networks are experiencing prodigious increase in data volume and ...
research
12/17/2018

Reinforcement Learning for Adaptive Caching with Dynamic Storage Pricing

Small base stations (SBs) of fifth-generation (5G) cellular networks are...
research
01/22/2018

A Learning-based Approach to Joint Content Caching and Recommendation at Base Stations

Recommendation system is able to shape user demands, which can be used f...
research
02/22/2021

Mobility-Aware Routing and Caching: A Federated Learning Assisted Approach

We develop mobility-aware routing and caching strategies to solve the ne...

Please sign up or login with your details

Forgot password? Click here to reset