Network friendly recommendations: Optimizing for long viewing sessions

Giannakas, Theodoros; Sermpezis, Pavlos; Spyropoulos, Thrasyvoulos
IEEE Transactions on Mobile Computing, 2 September 2021

Caching algorithms try to predict content popularity, and place the content closer to the users. Additionally, nowadays requests are increasingly driven by recommendation systems (RS). These important trends, point to the following: emph{make RSs favor locally cached content}, this way operators reduce network costs, and users get better streaming rates. Nevertheless, this process should preserve the quality of the recommendations (QoR). In this work, we propose a Markov Chain model for a stochastic, recommendation-driven emph of requests, and formulate the problem of selecting high quality recommendations that minimize the network cost emph{in the long run}. While the original optimization problem is non-convex, it can be convexified through a series of transformations. Moreover, we extend our framework for users who show preference in some positions of the recommendations' list. To our best knowledge, this is the first work to provide an optimal polynomial-time algorithm for these problems. Finally, testing our algorithms on real datasets suggests significant potential, e.g., 2× improvement compared to baseline recommendations, and 80% compared to a greedy network-friendly-RS (which optimizes the cost for I.I.D. requests), while preserving at least 90% of the original QoR. Finally, we show that taking position preference into account leads to additional performance gains.


DOI
Type:
Journal
Date:
2021-09-01
Department:
Communication systems
Eurecom Ref:
6658
Copyright:
© 2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PERMALINK : https://www.eurecom.fr/publication/6658