Joint Content Valuations and Proactive Caching for Content Distribution Networks

Due to the advances in machine learning techniques, recommender systems nowadays are capable of learning and influencing the users' decisions. Hence, recommendations became an important facility to reduce the cost (or increase the profit) of the operators of the demand networks. In this paper w...

Full description

Saved in:
Bibliographic Details
Published in2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC) pp. 100 - 105
Main Authors Youssef, Youssef A., Tadrous, John, Hosny, Sameh, Nafie, Mohammed
Format Conference Proceeding
LanguageEnglish
Published IEEE 08.01.2022
Subjects
Approximation algorithms
Content distribution networks
Cost accounting
Costs
Demand Shaping
Heuristic algorithms
Machine learning
Observability
Proactive Caching
Recommender Systems
Online AccessGet full text

Cover

More Information
Summary:Due to the advances in machine learning techniques, recommender systems nowadays are capable of learning and influencing the users' decisions. Hence, recommendations became an important facility to reduce the cost (or increase the profit) of the operators of the demand networks. In this paper we formulate and study the problem of dynamically optimizing the demand shaping, through content recommendation, and proactive caching. The formulated problem suffers from the curse of dimensionality, so we devise an approximate algorithm optimizing only over a short look-ahead window. The approximate problem is not convex, as such we utilize non-convex optimization techniques to tackle the problem. To verify the efficiency of our proposed solution, we establish a lower bound on the minimum achievable cost and contrast it with our solution.
ISSN:2331-9860
DOI:10.1109/CCNC49033.2022.9700717