不确定条件下经济高效的长期云投资组合配置的优化启发式方法

Maximilian Kießler, V. Haag, Benedikt Pittl, E. Schikuta
{"title":"不确定条件下经济高效的长期云投资组合配置的优化启发式方法","authors":"Maximilian Kießler, V. Haag, Benedikt Pittl, E. Schikuta","doi":"10.48550/arXiv.2206.07092","DOIUrl":null,"url":null,"abstract":"—Today’s cloud infrastructure landscape offers a broad range of services to build and operate software applications. The myriad of options, however, has also brought along a new layer of complexity. When it comes to procuring cloud computing resources, consumers can purchase their virtual ma- chines from different providers on different marketspaces to form so called cloud portfolios: a bundle of virtual machines whereby the virtual machines have different technical characteristics and pricing mechanisms. Thus, selecting the right server instances for a given set of applications such that the allocations are cost efficient is a non-trivial task. In this paper we propose a formal specification of the cloud portfolio management problem that takes an application-driven approach and incorporates the nuances of the commonly encountered reserved, on-demand and spot market types. We present two distinct cost optimization heuristics for this stochastic temporal bin packing problem, one taking a naive first fit strategy, while the other is built on the concepts of genetic algorithms. The results of the evaluation show that the former optimization approach significantly outperforms the latter, both in terms of execution speeds and solution quality.","PeriodicalId":424918,"journal":{"name":"International Conference on Information Integration and Web-based Applications & Services","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization Heuristics for Cost-Efficient Long-Term Cloud Portfolio Allocations Under Uncertainty\",\"authors\":\"Maximilian Kießler, V. Haag, Benedikt Pittl, E. Schikuta\",\"doi\":\"10.48550/arXiv.2206.07092\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"—Today’s cloud infrastructure landscape offers a broad range of services to build and operate software applications. The myriad of options, however, has also brought along a new layer of complexity. When it comes to procuring cloud computing resources, consumers can purchase their virtual ma- chines from different providers on different marketspaces to form so called cloud portfolios: a bundle of virtual machines whereby the virtual machines have different technical characteristics and pricing mechanisms. Thus, selecting the right server instances for a given set of applications such that the allocations are cost efficient is a non-trivial task. In this paper we propose a formal specification of the cloud portfolio management problem that takes an application-driven approach and incorporates the nuances of the commonly encountered reserved, on-demand and spot market types. We present two distinct cost optimization heuristics for this stochastic temporal bin packing problem, one taking a naive first fit strategy, while the other is built on the concepts of genetic algorithms. The results of the evaluation show that the former optimization approach significantly outperforms the latter, both in terms of execution speeds and solution quality.\",\"PeriodicalId\":424918,\"journal\":{\"name\":\"International Conference on Information Integration and Web-based Applications & Services\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Information Integration and Web-based Applications & Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2206.07092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Integration and Web-based Applications & Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2206.07092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

今天的云基础设施格局提供了广泛的服务来构建和运行软件应用程序。然而,无数的选择也带来了一层新的复杂性。当涉及到采购云计算资源时,消费者可以从不同市场空间的不同供应商处购买虚拟机,形成所谓的云组合:一组虚拟机,其中虚拟机具有不同的技术特征和定价机制。因此,为给定的一组应用程序选择正确的服务器实例,使分配具有成本效益,这是一项非常重要的任务。在本文中,我们提出了云投资组合管理问题的正式规范,该规范采用应用程序驱动的方法,并结合了常见的保留、按需和现货市场类型的细微差别。我们提出了两种不同的成本优化启发式算法,一种采用朴素的首次拟合策略,另一种基于遗传算法的概念。评估结果表明,前一种优化方法在执行速度和解决方案质量方面都明显优于后一种优化方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization Heuristics for Cost-Efficient Long-Term Cloud Portfolio Allocations Under Uncertainty
—Today’s cloud infrastructure landscape offers a broad range of services to build and operate software applications. The myriad of options, however, has also brought along a new layer of complexity. When it comes to procuring cloud computing resources, consumers can purchase their virtual ma- chines from different providers on different marketspaces to form so called cloud portfolios: a bundle of virtual machines whereby the virtual machines have different technical characteristics and pricing mechanisms. Thus, selecting the right server instances for a given set of applications such that the allocations are cost efficient is a non-trivial task. In this paper we propose a formal specification of the cloud portfolio management problem that takes an application-driven approach and incorporates the nuances of the commonly encountered reserved, on-demand and spot market types. We present two distinct cost optimization heuristics for this stochastic temporal bin packing problem, one taking a naive first fit strategy, while the other is built on the concepts of genetic algorithms. The results of the evaluation show that the former optimization approach significantly outperforms the latter, both in terms of execution speeds and solution quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信