Caching popular contents in advance is an important technique to achieve low latency and reduce the backhaul costs in future wireless communications. Considering a network with base stations distributed as a Poisson point process, optimal content placement caching probabilities are obtained to maximize the average success probability (ASP) for a known content popularity (CP) profile, which in practice is time-varying and unknown in advance. In this paper, we first propose two online prediction (OP) methods for forecasting CP viz., popularity prediction model (PPM) and Grassmannian prediction model (GPM), where the unconstrained coefficients for linear prediction are obtained by solving constrained non-negative least squares. To reduce the higher computational complexity per online round, two online learning (OL) approaches viz., weighted-follow-the-leader and weighted-follow-the-regularized-leader are proposed, inspired by the OP models. In OP, ASP difference (i.e, the gap between the ASP achieved by prediction and that by known content popularity) is bounded, while in OL, sub-linear MSE regret and linear ASP regret bounds are obtained. With MovieLens dataset, simulations verify that OP methods are better for MSE and ASP difference minimization, while the OL approaches perform well for the minimization of the MSE and ASP regrets.
- Linear prediction
- Poisson point process (PPP)
- online learning
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Garg, N., Sellathurai, M., Bhatia, V., Bharath, B. N., & Ratnarajah, T. (2020). Online Content Popularity Prediction and Learning in Wireless Edge Caching. IEEE Transactions on Communications, 68(2), 1087-1100. https://doi.org/10.1109/TCOMM.2019.2956041