Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/E21BE665-0EB8-475B-AD57-9C88DF8ADF6D | ||
| Year | 2022 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | D. Tsigkari and T. Spyropoulos, "Caching and recommendation decisions at transcoding-enabled base stations," in 2022 IEEE Global Communications Conference – Proceedings (GLOBECOM 2022), Rio de Janeiro, Brazil, 2022, doi: 10.1109/GLOBECOM48099.2022.10000796. https://doi.org/10.1109/GLOBECOM48099.2022.10000796 | ||
| Appears in Collections |
In the context of on-demand video streaming services, both the caching and the recommendation decisions have an impact on the user satisfaction, and thus, financial implications for the Content Provider (CP). The idea of co-designing thesedecisions has been recently proposed in the literature as a way to minimize delivery costs and traffic at the backbone Internet. However, related work does not take into account that every content exists in multiple versions/streaming qualities, or at besttreats each version as a separate content, when it comes to caching. In this paper, we explore how transcoding a content at the edge could avoid placing multiple related versions of this content in the same cache, thus better utilizing capacity (leading to an increase of the CP’s profit). To this end, we formulate the problem of jointly deciding on caching, recommendations, and user-transcoder assignments with the goal of increasing the profit (revenue minus the incurred costs). We propose an iterative algorithm that is based on a decomposition of the formulatedproblem into two subproblems. We show that both subproblems, although NP-hard, are equivalent to problems in the literature for which algorithms with approximation guarantees exist. Our numerical evaluations in realistic scenarios show that the proposed policy leads to important financial gains of up to 29% when compared to the scenario where edge transcoding is not exploited.
Copyright © DIAS 2013
