Abstract

Herein, we focus on an end-to-end design of a proactive cooperative caching strategy for a multi-cell network. The design is challenging as it involves two interrelated problems: the ability to predict future content popularity and to meet network operation characteristics. To this end, we first formulate a cooperative content caching in order to optimize the aggregated network cost for delivering contents to users. An efficient proactive caching policy requires an accurate prediction of time-varying content popularity. Content popularity has temporal and spatial dependencies and therefore, we develop a probabilistic dynamical model for content popularity prediction by exploiting its spatiotemporal correlations. To achieve an accurate tracking and prediction of content popularity evolution, the proposed dynamical model is non-linear and incorporates non-Gaussian distributions. We use Variational Bayes (VB) approach for estimating the model parameters. The VB provides mathematical tractability. We then develop an online VB method that works with streaming data where content request arrives sequentially. Using extensive simulations study on a real-world dataset, we show that our online VB based dynamical model provides improved performance compared to conventional content caching policies.

Highlights

  • Due to the emergence of communities with a massive number of users, the demands for content are explosively growing [1]

  • Our work proposes an end-to-end design of a proactive cooperative caching scheme for a multi-cell network by investigating popularity prediction, joint request routing and content placement algorithms

  • We showed that the model can perform better than the auto-regressive moving-average (ARMA) model by examining a realworld dataset

Read more

Summary

INTRODUCTION

Due to the emergence of communities with a massive number of users, the demands for content (e.g., video) are explosively growing [1]. The motivation behind caching is that typically the majority of data traffic is caused by only a small number of popular contents, as indicated by the Zipf-law behavior [3] Caching these highly popular contents at the edge which can be done during off peak hours bypasses the need for fetching these contents from the content provider through the backhaul links for every request. This can significantly reduce the network congestion and improve the user quality of experience. Our work proposes an end-to-end design of a proactive cooperative caching scheme for a multi-cell network by investigating popularity prediction, joint request routing and content placement algorithms.

RELATED WORKS
System model
Content caching policy
PROBABILISTIC DEMAND MODEL
BAYESIAN LEARNING
Posterior approximation
Prediction
ONLINE LEARNING
COMPUTATIONAL COMPLEXITY
VIII. SIMULATION RESULTS
Synthetic data
Real-world data
CONCLUSIONS
Findings
Stochastic successive convex approximation method
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call