基于ARMA的内容交付网络缓存流行度预测

N. Hassine, R. Milocco, P. Minet
{"title":"基于ARMA的内容交付网络缓存流行度预测","authors":"N. Hassine, R. Milocco, P. Minet","doi":"10.1109/WD.2017.7918125","DOIUrl":null,"url":null,"abstract":"Content Delivery Networks (CDNs) are faced with an increasing and time varying demand of video contents. Their ability to promptly react to this demand is a success factor. Caching helps, but the question is: which contents to cache? Considering that the most popular contents should be cached, this paper focuses on how to predict the popularity of video contents. With real traces extracted from YouTube, we show that Auto-Regressive and Moving Average (ARMA) models can provide accurate predictions. We propose an original solution combining the predictions of several ARMA models. This solution achieves a better Hit Ratio and a smaller Update Ratio than the classical Least Frequently Used (LFU) caching technique.","PeriodicalId":179998,"journal":{"name":"2017 Wireless Days","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"ARMA based popularity prediction for caching in Content Delivery Networks\",\"authors\":\"N. Hassine, R. Milocco, P. Minet\",\"doi\":\"10.1109/WD.2017.7918125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Content Delivery Networks (CDNs) are faced with an increasing and time varying demand of video contents. Their ability to promptly react to this demand is a success factor. Caching helps, but the question is: which contents to cache? Considering that the most popular contents should be cached, this paper focuses on how to predict the popularity of video contents. With real traces extracted from YouTube, we show that Auto-Regressive and Moving Average (ARMA) models can provide accurate predictions. We propose an original solution combining the predictions of several ARMA models. This solution achieves a better Hit Ratio and a smaller Update Ratio than the classical Least Frequently Used (LFU) caching technique.\",\"PeriodicalId\":179998,\"journal\":{\"name\":\"2017 Wireless Days\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Wireless Days\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WD.2017.7918125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Wireless Days","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WD.2017.7918125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

内容分发网络(cdn)面临着日益增长且随时间变化的视频内容需求。他们对这种需求迅速做出反应的能力是一个成功的因素。缓存有帮助,但问题是:缓存哪些内容?考虑到需要缓存最受欢迎的内容,本文重点研究如何预测视频内容的受欢迎程度。使用从YouTube中提取的真实轨迹,我们表明自回归和移动平均(ARMA)模型可以提供准确的预测。我们提出了一个结合多个ARMA模型预测的原始解决方案。与经典的最不频繁使用(LFU)缓存技术相比,该解决方案实现了更好的命中率和更小的更新率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ARMA based popularity prediction for caching in Content Delivery Networks
Content Delivery Networks (CDNs) are faced with an increasing and time varying demand of video contents. Their ability to promptly react to this demand is a success factor. Caching helps, but the question is: which contents to cache? Considering that the most popular contents should be cached, this paper focuses on how to predict the popularity of video contents. With real traces extracted from YouTube, we show that Auto-Regressive and Moving Average (ARMA) models can provide accurate predictions. We propose an original solution combining the predictions of several ARMA models. This solution achieves a better Hit Ratio and a smaller Update Ratio than the classical Least Frequently Used (LFU) caching technique.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信