Online Learning Models for Content Popularity Prediction In Wireless Edge Caching

01/19/2019
by   Navneet Garg, et al.
0

Caching popular contents in advance is an important technique to achieve the low latency requirement and to reduce the backhaul costs in future wireless communications. Considering a network with base stations distributed as a Poisson point process (PPP), optimal content placement caching probabilities are derived for known popularity profile, which is unknown in practice. In this paper, online prediction (OP) and online learning (OL) methods are presented based on popularity prediction model (PPM) and Grassmannian prediction model (GPM), to predict the content profile for future time slots for time-varying popularities. In OP, the problem of finding the coefficients is modeled as a constrained non-negative least squares (NNLS) problem which is solved with a modified NNLS algorithm. In addition, these two models are compared with log-request prediction model (RPM), information prediction model (IPM) and average success probability (ASP) based model. Next, in OL methods for the time-varying case, the cumulative mean squared error (MSE) is minimized and the MSE regret is analyzed for each of the models. Moreover, for quasi-time varying case where the popularity changes block-wise, KWIK (know what it knows) learning method is modified for these models to improve the prediction MSE and ASP performance. Simulation results show that for OP, PPM and GPM provides the best ASP among these models, concluding that minimum mean squared error based models do not necessarily result in optimal ASP. OL based models yield approximately similar ASP and MSE, while for quasi-time varying case, KWIK methods provide better performance, which has been verified with MovieLens dataset.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2020

The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity

In this paper, we design dynamic probabilistic caching for the scenario ...
research
09/09/2019

The Study of Dynamic Caching via State Transition Field – the Case of Time-Varying Popularity

In the second part of this two-part paper, we extend the study of dynami...
research
05/17/2018

Caching With Time-Varying Popularity Profiles: A Learning-Theoretic Perspective

Content caching at the small-cell base stations (sBSs) in a heterogeneou...
research
09/01/2018

Content Popularity Prediction Towards Location-Aware Mobile Edge Caching

Mobile edge caching enables content delivery within the radio access net...
research
10/12/2022

Multi-Content Time-Series Popularity Prediction with Multiple-Model Transformers in MEC Networks

Coded/uncoded content placement in Mobile Edge Caching (MEC) has evolved...
research
08/27/2018

Combining Predictions of Auto Insurance Claims

This paper aims at achieving better performance of prediction by combini...
research
07/03/2018

Approximate Survey Propagation for Statistical Inference

Approximate message passing algorithm enjoyed considerable attention in ...

Please sign up or login with your details

Forgot password? Click here to reset