内容交付网络中最优动态副本放置

N. Bartolini, F. L. Presti, C. Petrioli
{"title":"内容交付网络中最优动态副本放置","authors":"N. Bartolini, F. L. Presti, C. Petrioli","doi":"10.1109/ICON.2003.1266178","DOIUrl":null,"url":null,"abstract":"Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"582 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"Optimal dynamic replica placement in content delivery networks\",\"authors\":\"N. Bartolini, F. L. Presti, C. Petrioli\",\"doi\":\"10.1109/ICON.2003.1266178\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.\",\"PeriodicalId\":122389,\"journal\":{\"name\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"volume\":\"582 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2003.1266178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 40

摘要

内容交付网络(CDN)的设计需要放置服务器副本,使内容更接近用户,同时还需要一个高效的、内容感知的请求路由。在本文中,我们解决了动态副本放置的问题,以考虑用户需求的可变性,同时优化CDN提供商支付的成本和分布式副本服务器架构的整体性能。我们将动态副本放置问题表述为考虑交通状况、用户满意度以及从站点安装、维护或移除副本所支付的成本的半马尔可夫决策过程。所提出的模型适用于一般的网络拓扑,并考虑了网络和服务器容量的现实约束。利用决策模型推导出的最优策略为设计集中式启发式算法提供了依据,并作为启发式评估的基准。仿真结果表明,所提启发式算法的行为接近于最优策略,在用户到服务副本的平均距离小、副本的平均数量小、能够服务请求的概率大等方面取得了很好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal dynamic replica placement in content delivery networks
Content delivery networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a semi Markov decision process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信