Popularity prediction-based caching in content delivery networks

被引:7
|
作者
Ben Hassine, Nesrine [1 ]
Minet, Pascale [1 ]
Marinca, Dana [2 ]
Barth, Dominique [2 ]
机构
[1] INRIA, Paris, France
[2] Univ Versailles, DAVID, Versailles, France
关键词
Machine learning; Prediction; CDN; Caching; Video popularity; Expert; Forecaster;
D O I
10.1007/s12243-018-00700-8
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In content delivery networks (CDNs), caches are resources that must be allocated. For that purpose, videos' popularity knowledge helps to make efficient decisions about which videos should be cached. Thus, we must be able to anticipate future needs in terms of requested videos. To do this, we rely on the requests history. This paper focuses on predicting the videos' popularity: the daily number of requests. For that purpose, we propose a two-level prediction approach. At the first level, the experts compute the videos' popularity, each expert using its own prediction method with its own parameters. At the second level, the forecasters select the best experts and build a prediction based on the predictions provided by these experts. The prediction accuracy is evaluated by a loss function as the discrepancy between the prediction value and the real number of requests. We use real traces extracted from YouTube to compare different prediction methods and determine the best parameter tuning for experts and forecasters. The goal is to find the best trade-off between complexity and accuracy of the prediction methods used. Finally, we apply these prediction methods to caching. Prediction methods are compared in terms of cache hit ratio and update ratio. The gain brought by this two-level prediction approach is compared with that obtained by a single prediction level. The results show that the choice of a two-level prediction approach is justified.
引用
收藏
页码:351 / 364
页数:14
相关论文
共 50 条
  • [1] Popularity prediction–based caching in content delivery networks
    Nesrine Ben Hassine
    Pascale Minet
    Dana Marinca
    Dominique Barth
    Annals of Telecommunications, 2019, 74 : 351 - 364
  • [2] ARMA based Popularity Prediction for Caching in Content Delivery Networks
    Ben Hassine, Nesrine
    Miloccoz, Ruben
    Minet, Pascale
    2017 WIRELESS DAYS, 2017, : 113 - 120
  • [3] Sequence Prediction-based Proactive Caching in Vehicular Content Networks
    Wang, Qiao
    Grace, David
    2020 IEEE 3RD CONNECTED AND AUTOMATED VEHICLES SYMPOSIUM (CAVS), 2020,
  • [4] LSTM for Mobility Based Content Popularity Prediction in Wireless Caching Networks
    Mou, Hardin
    Liu, Yuhong
    Wang, Li
    2019 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2019,
  • [5] Popularity Prediction in Content Delivery Networks
    Ben Hassine, Nesrine
    Marinca, Dana
    Minet, Pascale
    Barth, Dominique
    2015 IEEE 26TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2015, : 2083 - 2088
  • [6] Popularity prediction caching based on logistic regression in vehicular content centric networks
    Yao, Kai
    Li, Zhaoyang
    Yao, Lin
    Lang, Kuijun
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2020, 35 (03) : 150 - 161
  • [7] Content Popularity-based Caching Techniques for Wireless Content Delivery
    Hong, Jun-Pyo
    2015 INTERNATIONAL CONFERENCE ON ICT CONVERGENCE (ICTC), 2015, : 1300 - 1302
  • [8] Clustered Popularity Prediction for Content Caching
    Chen, Qi
    Wang, Wei
    Zhang, Zhaoyang
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
  • [9] A Feedback Mechanism for Prediction-based Anomaly Detection In Content Delivery Networks
    Liu, Zhilei
    Lin, Tao
    Dai, Liang
    Sun, Jiyan
    Hu, Yanjie
    Zhang, Yan
    Xu, Zhen
    2020 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2020, : 404 - 410
  • [10] PPP: Prefix-based Popularity Prediction for Efficient Content Caching in Content-Centric Networks
    Ren, Jianji
    Zhao, Shan
    Sun, Junding
    Li, Ding
    Wang, Song
    Jia, Zongpu
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2018, 33 (04): : 259 - 265