On the merits of popularity prediction in multimedia content caching

J. Famaey, T. Wauters, F. Turck
{"title":"On the merits of popularity prediction in multimedia content caching","authors":"J. Famaey, T. Wauters, F. Turck","doi":"10.1109/INM.2011.5990669","DOIUrl":null,"url":null,"abstract":"In recent years, telecom operators have been moving away from traditional, broadcast-driven, television towards IP-based, interactive and on-demand services. Consequently, multicast is no longer a viable solution to limit the amount of traffic in the IP-TV network. In order to counter an explosion in generated traffic, caches can be strategically placed throughout the content delivery infrastructure. As the size of caches is usually limited to only a small fraction of the total size of all content items, it is important to accurately predict future content popularity. Classical caching strategies only take into account the past when deciding what content to cache. Recently, a trend towards novel strategies that actually try to predict future content popularity has arisen. In this paper, we ascertain the viability of using popularity prediction in realistic multimedia content caching scenarios. The use of popularity prediction is compared to classical strategies using trace files from an actual deployed Video on Demand service. Additionally, the synergy between several parameters, such as cache size and prediction window, is investigated.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INM.2011.5990669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

In recent years, telecom operators have been moving away from traditional, broadcast-driven, television towards IP-based, interactive and on-demand services. Consequently, multicast is no longer a viable solution to limit the amount of traffic in the IP-TV network. In order to counter an explosion in generated traffic, caches can be strategically placed throughout the content delivery infrastructure. As the size of caches is usually limited to only a small fraction of the total size of all content items, it is important to accurately predict future content popularity. Classical caching strategies only take into account the past when deciding what content to cache. Recently, a trend towards novel strategies that actually try to predict future content popularity has arisen. In this paper, we ascertain the viability of using popularity prediction in realistic multimedia content caching scenarios. The use of popularity prediction is compared to classical strategies using trace files from an actual deployed Video on Demand service. Additionally, the synergy between several parameters, such as cache size and prediction window, is investigated.
浅谈多媒体内容缓存中流行度预测的优点
近年来,电信运营商已经从传统的、广播驱动的电视业务转向基于ip的、交互式的、按需的业务。因此,多播不再是限制IP-TV网络中流量的可行解决方案。为了应对生成的流量激增,可以在整个内容交付基础设施中战略性地放置缓存。由于缓存的大小通常仅限于所有内容项总大小的一小部分,因此准确预测未来内容的流行程度非常重要。经典的缓存策略在决定缓存什么内容时只考虑过去。最近,出现了一种尝试预测未来内容受欢迎程度的新策略趋势。在本文中,我们确定了在现实的多媒体内容缓存场景中使用流行度预测的可行性。将流行度预测的使用与使用来自实际部署的视频点播服务的跟踪文件的经典策略进行比较。此外,还研究了缓存大小和预测窗口等参数之间的协同作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信