内容交付的在线服务策略

Kota Srinivas Reddy, Arunabh Saxena, Sharayu Moharir, N. Karamchandani
{"title":"内容交付的在线服务策略","authors":"Kota Srinivas Reddy, Arunabh Saxena, Sharayu Moharir, N. Karamchandani","doi":"10.1109/SPCOM50965.2020.9179501","DOIUrl":null,"url":null,"abstract":"Content Delivery Networks (CDNs) are an essential component of Video on Demand (VoD) services. We consider a content delivery system comprising a central server connected to several co-located caches, each with limited storage and service capabilities. We evaluate the performance of our storage policy when coupled with online service policies as a function of cache size, file library size, and the number of caches. We show that for file libraries with Zipf popularity profiles, our storage policy, when coupled with any online service policy, which allocates each request to a cache if possible, is as effective as the best offline service policy existing in the literature. The advantage of online service policies is that they have smaller time complexity than offline service policies. We also support our theoretical results via simulations for finite-size systems.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"16 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online Service Policies for Content Delivery\",\"authors\":\"Kota Srinivas Reddy, Arunabh Saxena, Sharayu Moharir, N. Karamchandani\",\"doi\":\"10.1109/SPCOM50965.2020.9179501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Content Delivery Networks (CDNs) are an essential component of Video on Demand (VoD) services. We consider a content delivery system comprising a central server connected to several co-located caches, each with limited storage and service capabilities. We evaluate the performance of our storage policy when coupled with online service policies as a function of cache size, file library size, and the number of caches. We show that for file libraries with Zipf popularity profiles, our storage policy, when coupled with any online service policy, which allocates each request to a cache if possible, is as effective as the best offline service policy existing in the literature. The advantage of online service policies is that they have smaller time complexity than offline service policies. We also support our theoretical results via simulations for finite-size systems.\",\"PeriodicalId\":208527,\"journal\":{\"name\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"volume\":\"16 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCOM50965.2020.9179501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Signal Processing and Communications (SPCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM50965.2020.9179501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

内容交付网络(cdn)是视频点播(VoD)服务的重要组成部分。我们考虑一个内容交付系统,它包括一个中央服务器,它连接到几个位于同一位置的缓存,每个缓存都具有有限的存储和服务能力。当与在线服务策略结合使用时,我们将存储策略的性能作为缓存大小、文件库大小和缓存数量的函数进行评估。我们表明,对于具有Zipf流行配置文件的文件库,我们的存储策略与任何在线服务策略(如果可能的话,将每个请求分配到缓存)相结合时,与文献中现有的最佳离线服务策略一样有效。在线业务策略的优点是时间复杂度比离线业务策略小。我们还通过对有限大小系统的模拟来支持我们的理论结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online Service Policies for Content Delivery
Content Delivery Networks (CDNs) are an essential component of Video on Demand (VoD) services. We consider a content delivery system comprising a central server connected to several co-located caches, each with limited storage and service capabilities. We evaluate the performance of our storage policy when coupled with online service policies as a function of cache size, file library size, and the number of caches. We show that for file libraries with Zipf popularity profiles, our storage policy, when coupled with any online service policy, which allocates each request to a cache if possible, is as effective as the best offline service policy existing in the literature. The advantage of online service policies is that they have smaller time complexity than offline service policies. We also support our theoretical results via simulations for finite-size systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信