Maintenance Scheduling for Cloud Infrastructure with Timing Constraints of Live Migration

Shingo Okuno, Fumi Iikura, Yukihiro Watanabe
{"title":"Maintenance Scheduling for Cloud Infrastructure with Timing Constraints of Live Migration","authors":"Shingo Okuno, Fumi Iikura, Yukihiro Watanabe","doi":"10.1109/IC2E.2019.00032","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an implementation of a maintenance scheduler for cloud infrastructures. Live migration associated with maintenance work is important to ensure service continuity for all virtual machines in an infrastructure. However, executing the migration process when the machines are under heavy load negatively affects cloud users' businesses, such as by degrading performance and extending downtime. We can avoid this by finding an appropriate time period for live migration and performing the migration then. This idea is convenient for cloud users but inconvenient for cloud providers, that is, maintenance work should be completed as soon as possible for security reasons. To satisfy both the users' convenience and providers' requirements, we designed a maintenance scheduling problem to find the appropriate time period and to shorten the maintenance work period. Since it is a large-scale combinatorial optimization problem with complex constraints on maintenance requirements, we described the constraints by using answer set programming and implemented a maintenance scheduler on the basis of a divide-and-conquer approach to reduce the computational complexity exponentially. We evaluated our scheduler by using information on a real configuration of a commercial cloud infrastructure. While a naive approach to solving the maintenance scheduling problem could not find any feasible solutions within a realistic amount of time and memory, our implementation generated the best maintenance schedule for 1032 physical machines and 14208 virtual machines in 206 s with a memory usage of 1086 MB.","PeriodicalId":226094,"journal":{"name":"2019 IEEE International Conference on Cloud Engineering (IC2E)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Cloud Engineering (IC2E)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC2E.2019.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we propose an implementation of a maintenance scheduler for cloud infrastructures. Live migration associated with maintenance work is important to ensure service continuity for all virtual machines in an infrastructure. However, executing the migration process when the machines are under heavy load negatively affects cloud users' businesses, such as by degrading performance and extending downtime. We can avoid this by finding an appropriate time period for live migration and performing the migration then. This idea is convenient for cloud users but inconvenient for cloud providers, that is, maintenance work should be completed as soon as possible for security reasons. To satisfy both the users' convenience and providers' requirements, we designed a maintenance scheduling problem to find the appropriate time period and to shorten the maintenance work period. Since it is a large-scale combinatorial optimization problem with complex constraints on maintenance requirements, we described the constraints by using answer set programming and implemented a maintenance scheduler on the basis of a divide-and-conquer approach to reduce the computational complexity exponentially. We evaluated our scheduler by using information on a real configuration of a commercial cloud infrastructure. While a naive approach to solving the maintenance scheduling problem could not find any feasible solutions within a realistic amount of time and memory, our implementation generated the best maintenance schedule for 1032 physical machines and 14208 virtual machines in 206 s with a memory usage of 1086 MB.
基于热迁移时间约束的云基础设施维护调度
在本文中,我们提出了一种云基础设施维护调度程序的实现。与维护工作相关的实时迁移对于确保基础设施中所有虚拟机的服务连续性非常重要。但是,在机器处于高负载时执行迁移过程会对云用户的业务产生负面影响,例如降低性能和延长停机时间。我们可以通过为实时迁移找到合适的时间段,然后执行迁移来避免这种情况。这种思路对云用户来说是方便的,但对云提供商来说是不方便的,即出于安全考虑,维护工作应该尽快完成。为了满足用户的便利性和供应商的需求,我们设计了一个维护调度问题,以找到合适的时间周期,缩短维护工作周期。由于这是一个具有复杂维护需求约束的大规模组合优化问题,我们使用答案集编程来描述约束,并基于分而治之的方法实现维护调度程序,以指数方式降低计算复杂度。我们通过使用商业云基础设施的真实配置信息来评估调度器。虽然解决维护调度问题的简单方法无法在实际的时间和内存量内找到任何可行的解决方案,但我们的实现在205s内为1032台物理机和14208台虚拟机生成了最佳维护调度,内存使用量为1086 MB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信