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}
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.