Overbooking-enabled Virtual Machine Deployment Approach in Mobile Edge Computing

Bingyi Hu, Jixun Gao, Quanzhen Huang, Huaichen Wang, Yanxin Hu, Jialei Liu, Yanmin Ge
{"title":"Overbooking-enabled Virtual Machine Deployment Approach in Mobile Edge Computing","authors":"Bingyi Hu, Jixun Gao, Quanzhen Huang, Huaichen Wang, Yanxin Hu, Jialei Liu, Yanmin Ge","doi":"10.1109/ICSS55994.2022.00041","DOIUrl":null,"url":null,"abstract":"Mobile Edge Computing (MEC) integrates computing, storage and other resources on the edge of the network and constructs a unified user service platform. Then, according to the principle of nearest service, MEC responds to the task requests of the edge nodes in time and effectively processes them. In MEC, edge servers are virtualized into several slots so that resources can be shared among different mobile users. However, there are many unpredictable risks in MEC, these risks can cause edge servers to fail, the virtual machine deployed in the server slot fails and the task cannot be executed normally. The introduction of primary-backup virtual machines solves this problem well. However, when the primary virtual machine is working normally, its backup virtual machine is idle, this will result in a waste of resources. In order to improve the resource utilization of the system, this paper firstly overbooks the backup virtual machine reasonably, and then formulates the virtual machine deployment problem as a combinatorial optimization problem. Finally, Virtual Machine Deployment Algorithm (VMDA) is proposed based on genetic algorithm. With the increase of the number of algorithm iterations and the population size of the virtual machine deployment scheme, there may be more optimal virtual machine deployment scheme individuals in the population. Therefore, the algorithm can obtain the approximate optimal value of resource utilization within the risk range allowed by the system, and the algorithm is compared with two other typical bin packing algorithms. The results confirm that VMDA outperforms the other two algorithms.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Service Science (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS55994.2022.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile Edge Computing (MEC) integrates computing, storage and other resources on the edge of the network and constructs a unified user service platform. Then, according to the principle of nearest service, MEC responds to the task requests of the edge nodes in time and effectively processes them. In MEC, edge servers are virtualized into several slots so that resources can be shared among different mobile users. However, there are many unpredictable risks in MEC, these risks can cause edge servers to fail, the virtual machine deployed in the server slot fails and the task cannot be executed normally. The introduction of primary-backup virtual machines solves this problem well. However, when the primary virtual machine is working normally, its backup virtual machine is idle, this will result in a waste of resources. In order to improve the resource utilization of the system, this paper firstly overbooks the backup virtual machine reasonably, and then formulates the virtual machine deployment problem as a combinatorial optimization problem. Finally, Virtual Machine Deployment Algorithm (VMDA) is proposed based on genetic algorithm. With the increase of the number of algorithm iterations and the population size of the virtual machine deployment scheme, there may be more optimal virtual machine deployment scheme individuals in the population. Therefore, the algorithm can obtain the approximate optimal value of resource utilization within the risk range allowed by the system, and the algorithm is compared with two other typical bin packing algorithms. The results confirm that VMDA outperforms the other two algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
移动边缘计算中启用超额预订的虚拟机部署方法
移动边缘计算(MEC)将网络边缘的计算、存储等资源进行整合,构建统一的用户服务平台。然后,MEC根据最近服务原则,及时响应边缘节点的任务请求,并对其进行有效处理。在MEC中,边缘服务器被虚拟化到多个插槽中,以便在不同的移动用户之间共享资源。但是,MEC中存在许多不可预测的风险,这些风险可能导致边缘服务器故障,服务器插槽中部署的虚拟机故障,任务无法正常执行。主备份虚拟机的引入很好地解决了这个问题。但是,当主虚拟机正常工作时,其备份虚拟机处于空闲状态,会造成资源的浪费。为了提高系统的资源利用率,本文首先合理超量备份虚拟机,然后将虚拟机部署问题表述为组合优化问题。最后,提出了基于遗传算法的虚拟机部署算法(VMDA)。随着算法迭代次数的增加和虚拟机部署方案种群规模的增大,种群中可能存在更多的最优虚拟机部署方案个体。因此,该算法可以在系统允许的风险范围内获得资源利用率的近似最优值,并与另外两种典型的装箱算法进行了比较。结果表明,VMDA算法优于其他两种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Game difficulty prediction algorithm based on improved Monte Carlo tree A Process Evaluation Method for Crossover Service Recommendation SUAM: A Service Unified Access Model for Microservice Management A Study on Sentiment Analysis for Smart Tourism Optimization of Service Scheduling in Computing Force Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1