云环境下多类型资源概率保护的鲁棒优化

Mitsuki Ito, Fujun He, E. Oki
{"title":"云环境下多类型资源概率保护的鲁棒优化","authors":"Mitsuki Ito, Fujun He, E. Oki","doi":"10.1109/CloudNet51028.2020.9335810","DOIUrl":null,"url":null,"abstract":"This paper proposes a robust optimization model for probabilistic protection with multiple types of resources to minimize the required backup capacity for each type of resource against multiple random failures of physical machines in a cloud provider. If random failures occur, the required capacities for virtual machines are allocated to the dedicated backup physical machines, which are determined in advance. Probabilistic protection restricts the probability that the workload caused by failures exceeds the backup capacity by a given survivability parameter. We introduce three survivability parameters for central processing unit (CPU), memory, and the entire cloud provider considering both CPU and memory. By using the relationship between the three survivability parameters, the proposed model guarantees probabilistic protection for each resource, CPU and memory, and the entire cloud provider. By adopting the robust optimization technique, we formulate the proposed model as a multi-objective mixed integer linear programming problem. To deal with the multi-objective optimization problem, we apply the lexicographic weighted Tchebycheff method with which a Pareto optimal solution is obtained. Our proposed model reduces the average value between the backup capacity ratios of CPU and memory compared with the conventional model.","PeriodicalId":156419,"journal":{"name":"2020 IEEE 9th International Conference on Cloud Networking (CloudNet)","volume":"478 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Robust Optimization for Probabilistic Protection with Multiple Types of Resources in Cloud\",\"authors\":\"Mitsuki Ito, Fujun He, E. Oki\",\"doi\":\"10.1109/CloudNet51028.2020.9335810\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a robust optimization model for probabilistic protection with multiple types of resources to minimize the required backup capacity for each type of resource against multiple random failures of physical machines in a cloud provider. If random failures occur, the required capacities for virtual machines are allocated to the dedicated backup physical machines, which are determined in advance. Probabilistic protection restricts the probability that the workload caused by failures exceeds the backup capacity by a given survivability parameter. We introduce three survivability parameters for central processing unit (CPU), memory, and the entire cloud provider considering both CPU and memory. By using the relationship between the three survivability parameters, the proposed model guarantees probabilistic protection for each resource, CPU and memory, and the entire cloud provider. By adopting the robust optimization technique, we formulate the proposed model as a multi-objective mixed integer linear programming problem. To deal with the multi-objective optimization problem, we apply the lexicographic weighted Tchebycheff method with which a Pareto optimal solution is obtained. Our proposed model reduces the average value between the backup capacity ratios of CPU and memory compared with the conventional model.\",\"PeriodicalId\":156419,\"journal\":{\"name\":\"2020 IEEE 9th International Conference on Cloud Networking (CloudNet)\",\"volume\":\"478 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 9th International Conference on Cloud Networking (CloudNet)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CloudNet51028.2020.9335810\",\"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 IEEE 9th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet51028.2020.9335810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种具有多种类型资源的概率保护的鲁棒优化模型,以最大限度地减少每种类型资源对云提供商中物理机器的多个随机故障所需的备份容量。如果出现随机故障,系统会将虚拟机所需的容量分配给预先确定的专用备份物理机。概率保护通过给定的生存性参数限制故障导致的工作负载超过备份容量的概率。我们为中央处理单元(CPU)、内存和考虑CPU和内存的整个云提供商引入三个生存性参数。通过使用三个生存性参数之间的关系,所提出的模型保证了对每个资源、CPU和内存以及整个云提供商的概率保护。采用鲁棒优化技术,将该模型表述为多目标混合整数线性规划问题。为了处理多目标优化问题,我们采用字典加权Tchebycheff方法,该方法得到了Pareto最优解。与传统模型相比,该模型降低了CPU和内存备份容量比的平均值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust Optimization for Probabilistic Protection with Multiple Types of Resources in Cloud
This paper proposes a robust optimization model for probabilistic protection with multiple types of resources to minimize the required backup capacity for each type of resource against multiple random failures of physical machines in a cloud provider. If random failures occur, the required capacities for virtual machines are allocated to the dedicated backup physical machines, which are determined in advance. Probabilistic protection restricts the probability that the workload caused by failures exceeds the backup capacity by a given survivability parameter. We introduce three survivability parameters for central processing unit (CPU), memory, and the entire cloud provider considering both CPU and memory. By using the relationship between the three survivability parameters, the proposed model guarantees probabilistic protection for each resource, CPU and memory, and the entire cloud provider. By adopting the robust optimization technique, we formulate the proposed model as a multi-objective mixed integer linear programming problem. To deal with the multi-objective optimization problem, we apply the lexicographic weighted Tchebycheff method with which a Pareto optimal solution is obtained. Our proposed model reduces the average value between the backup capacity ratios of CPU and memory compared with the conventional model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信