Online Caching through Optimistic Online Mirror Descent
G.J. Admiraal (TU Delft - Electrical Engineering, Mathematics and Computer Science)
George Iosifidis – Mentor (TU Delft - Embedded Systems)
Naram Mhaisen – Graduation committee member (TU Delft - Embedded Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The advent of wireless networks such as content distribution networks and edge computing networks calls for more effective online caching policies. Traditional policies lose performance since these new networks deal with highly non-stationary requests and frequent popularity shifts. Consequently, a new framework called Online Convex Optimization (OCO), which does not assume the request pattern, has recently been used to tackle the online caching problem. Besides, in many practical scenarios, a request prediction of unknown quality is available. This paper will leverage that and proposes a new online caching policy that uses these predictions. This policy will use the Optimistic Online Mirror Descent (OOMD) algorithm to solve the OCO problem. The policy will still obtain the same regret bound as its non-optimistic counterpart up to some constant even if the predictions are not accurate. The performance of the proposed policy is evaluated and compared with previous OCO-based policies with the use of trace-driven numerical tests.