Predictive Caching via Learning Temporal Distribution of Content Requests

Abstract

In this letter, dynamic content placement of a local cache server that can store a subset of content objects in its cache memory is studied. Contrary to the conventional model in which content placement is optimized based on the time-invariant popularity distribution of content objects, we consider a general time-varying popularity distribution and such a probabilistic distribution is unknown for content placement. A novel learning method for predicting the temporal distribution of future content requests is presented, which utilizes the request histories of content objects whose lifespans are expired. Then we introduce the so-called predictive caching strategy in which content placement is periodically updated based on the estimated future content requests for each update period. Numerical evaluation is performed using real-world datasets reflecting the inherent nature of temporal dynamics, demonstrating that the proposed predictive caching outperforms the conventional online caching strategies.This work was supported in part by the Electronics and Telecommunications Research Institute (ETRI) grant funded by the Korean Government (18ZF1100, Wireless Transmission Technology in Multi-point to Multi-point Communications) and the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF2017R1D1A1A09000835)

Similar works

Full text

thumbnail-image

HANYANG Repository

redirect
Last time updated on 02/04/2020

This paper was published in HANYANG Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.