Multiobjective cloud capacity planning for time-varying customer demand

Brian Bouterse, H. Perros, D. Thuente
{"title":"Multiobjective cloud capacity planning for time-varying customer demand","authors":"Brian Bouterse, H. Perros, D. Thuente","doi":"10.1109/HONET.2014.7029367","DOIUrl":null,"url":null,"abstract":"Service providers who dynamically scale cloud resources can significantly lower costs while providing a service level that conforms to a service level agreement. To do this, service providers must understand the tradeoffs within provisioning algorithms such as utilization versus system availability or the impact of service level agreement timescale on utilization. Within the context of three provisioning algorithms from existing literature, we analyze the tradeoff of service availability versus utilization using a two-dimensional Pareto analysis. We also analyze the impact on utilization and system availability of using hourly, daily, weekly, or yearlong timescales as the basis of service level agreement. We evaluate model performance using historical data of the Virtual Computing Laboratory (VCL), a cloud computing environment at North Carolina State University. We show that a simple heuristic planning model, whereby a fixed reserve capacity is maintained, provides better service availability and utilization performance than other models for all service level timescales. The fixed reserve capacity model is also shown to be Pareto optimal.","PeriodicalId":297826,"journal":{"name":"2014 11th Annual High Capacity Optical Networks and Emerging/Enabling Technologies (Photonics for Energy)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th Annual High Capacity Optical Networks and Emerging/Enabling Technologies (Photonics for Energy)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HONET.2014.7029367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Service providers who dynamically scale cloud resources can significantly lower costs while providing a service level that conforms to a service level agreement. To do this, service providers must understand the tradeoffs within provisioning algorithms such as utilization versus system availability or the impact of service level agreement timescale on utilization. Within the context of three provisioning algorithms from existing literature, we analyze the tradeoff of service availability versus utilization using a two-dimensional Pareto analysis. We also analyze the impact on utilization and system availability of using hourly, daily, weekly, or yearlong timescales as the basis of service level agreement. We evaluate model performance using historical data of the Virtual Computing Laboratory (VCL), a cloud computing environment at North Carolina State University. We show that a simple heuristic planning model, whereby a fixed reserve capacity is maintained, provides better service availability and utilization performance than other models for all service level timescales. The fixed reserve capacity model is also shown to be Pareto optimal.
针对时变客户需求的多目标云容量规划
动态扩展云资源的服务提供商可以显著降低成本,同时提供符合服务级别协议的服务级别。要做到这一点,服务提供者必须了解供应算法中的权衡,例如利用率与系统可用性,或者服务水平协议时间尺度对利用率的影响。在现有文献中的三种供应算法的上下文中,我们使用二维Pareto分析分析了服务可用性与利用率之间的权衡。我们还分析了使用每小时、每天、每周或每年的时间尺度作为服务水平协议的基础对利用率和系统可用性的影响。我们使用虚拟计算实验室(VCL)的历史数据来评估模型的性能,VCL是北卡罗来纳州立大学的一个云计算环境。我们证明了一个简单的启发式规划模型,其中一个固定的储备容量保持,提供更好的服务可用性和利用性能比其他模型在所有服务水平的时间尺度。固定储备容量模型也具有帕累托最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信