论文标题
近似算法,用于关节缓存和建议网络中的建议
An approximation algorithm for joint caching and recommendations in cache networks
论文作者
论文摘要
Netflix和YouTube等流媒体平台努力为用户提供高流率,延迟等方面的高流质量(SQ)。同时,这些平台的内容消耗中很大一部分受建议的影响很大。在这种情况下,用户的整体体验是用户对推荐内容的兴趣的产物,即推荐质量(RQ)和此内容的SQ。但是,通常在不考虑推荐人的行动的情况下做出影响SQ的网络决策(例如缓存)。同样,建议独立于潜在的交付质量。在本文中,我们定义了流媒体体验(MOSE)的指标,该指标捕获了SQ和RQ之间的基本权衡。我们旨在在通用的缓存网络中共同优化缓存和建议,以最大程度地提高该指标。这与内容提供商同时充当内容交付网络所有者的最新趋势是一致的,这意味着同一实体可以处理缓存和建议决策。我们制定了这个关节优化问题,并证明可以将其近似为恒定因素。据我们所知,这是第一个为关节问题实现恒定近似比的多项式算法。此外,我们的数值实验显示了我们对基线方案和文献中现有算法的算法的重要性能提高。
Streaming platforms, like Netflix and YouTube, strive to offer high streaming quality (SQ), in terms of bitrate, delays, etc., to their users. Meanwhile, a significant share of content consumption of these platforms is heavily influenced by recommendations. In this setting, the user's overall experience is a product of both the user's interest in a recommended content, i.e., the recommendation quality (RQ), and the SQ of this content. However, network decisions (like caching) that affect the SQ are usually made without considering the recommender's actions. Likewise, recommendations are chosen independently of the potential delivery quality. In this paper, we define a metric of streaming experience (MoSE) that captures the fundamental tradeoff between the SQ and RQ. We aim to jointly optimize caching and recommendations in a generic network of caches, with the objective of maximizing this metric. This is in line with the recent trend for content providers to simultaneously act as Content Delivery Network owners, implying that the same entity may handle both caching and recommendation decisions. We formulate this joint optimization problem and prove that it can be approximated up to a constant factor. To the best of our knowledge, this is the first polynomial algorithm to achieve a constant approximation ratio for the joint problem. Moreover, our numerical experiments show important performance gains of our algorithm over baseline schemes and existing algorithms in the literature.