SCIENCE@home

Adapting Caching to Audience Retention Rate: Which Video Chunk to Store?

L. Maggi,Lazaros Gkatzikis,G. Paschos,Jérémie Leguay

Published 2015 in arXiv.org

ABSTRACT

Rarely do users watch online contents entirely. We study how to take this into account to improve the performance of cache systems for video-on-demand and video-sharing platforms in terms of traffic reduction on the core network. We exploit the notion of "Audience retention rate", introduced by mainstream online content platforms and measuring the popularity of different parts of the same video content. We first characterize the performance limits of a cache able to store parts of videos, when the popularity and the audience retention rate of each video are available to the cache manager. We then relax the assumption of known popularity and we propose a LRU (Least Recently Used) cache replacement policy that operates on the first chunks of each video. We characterize its performance by extending the well-known Che's approximation to this case. We prove that, by refining the chunk granularity, the chunk-LRU policy increases its performance. It is shown numerically that even for a small number of chunks (N=20), the gains of chunk-LRU are still significant in comparison to standard LRU policy that caches entire files, and they are almost optimal.

PUBLICATION RECORD

  • Publication year

    2015

  • Venue

    arXiv.org

  • Publication date

    2015-12-10

  • Fields of study

    Computer Science

  • Identifiers
    arXiv 1512.03274
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-17 of 17 references · Page 1 of 1

CITED BY

Showing 1-16 of 16 citing papers · Page 1 of 1