Caching Partial Files for Content Delivery

V. S. C. L. Narayana, Sambhav Jain, Sharayu Moharir
{"title":"Caching Partial Files for Content Delivery","authors":"V. S. C. L. Narayana, Sambhav Jain, Sharayu Moharir","doi":"10.1109/NCC.2019.8732266","DOIUrl":null,"url":null,"abstract":"Numerous empirical studies have shown that users of video-on-demand platforms do not always watch videos in their entirety. A direct consequence of this is that not all parts of a video are equally popular. Motivated by this, we explore the benefits of dividing files into smaller segments for caching. We treat incoming requests as requests for segments of files and propose a Markovian request model which captures the time-correlation in requests. We characterize the fundamental limit on the performance of caching policies which only cache full files. Next, we propose and analyze the performance of policies which cache partial files. Using this, we characterize the potential for improvement in performance due to caching partial files and analyze its dependence on various system parameters like cache size and the popularity profile of the files being cached.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2019.8732266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Numerous empirical studies have shown that users of video-on-demand platforms do not always watch videos in their entirety. A direct consequence of this is that not all parts of a video are equally popular. Motivated by this, we explore the benefits of dividing files into smaller segments for caching. We treat incoming requests as requests for segments of files and propose a Markovian request model which captures the time-correlation in requests. We characterize the fundamental limit on the performance of caching policies which only cache full files. Next, we propose and analyze the performance of policies which cache partial files. Using this, we characterize the potential for improvement in performance due to caching partial files and analyze its dependence on various system parameters like cache size and the popularity profile of the files being cached.
为内容交付缓存部分文件
大量实证研究表明,视频点播平台的用户并不总是完整地观看视频。这样做的一个直接后果是,并非视频的所有部分都同样受欢迎。受此启发,我们探索了将文件分成更小段进行缓存的好处。我们将传入请求视为对文件段的请求,并提出了一个马尔可夫请求模型,该模型捕获了请求中的时间相关性。我们描述了仅缓存完整文件的缓存策略性能的基本限制。接下来,我们提出并分析了缓存部分文件的策略的性能。使用它,我们描述了由于缓存部分文件而提高性能的潜力,并分析了它对各种系统参数(如缓存大小和被缓存文件的流行概况)的依赖。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信