基于Dueling-DDQN的云计算系统虚拟机布局算法

Jiling Yan, Jianyu Xiao, Xuemin Hong
{"title":"基于Dueling-DDQN的云计算系统虚拟机布局算法","authors":"Jiling Yan, Jianyu Xiao, Xuemin Hong","doi":"10.1109/iccc52777.2021.9580393","DOIUrl":null,"url":null,"abstract":"Virtual machine placement (VMP) in large-scale cloud computing clusters is a challenging problem with practical importance. Deep Q-learning (DQN) based algorithm is a promising means to solve difficult VMP problems with complex optimization goals and dynamically changing environments. However, native DQN algorithms suffer from shortcomings such as Q value overestimation, difficulty in convergence, and failure to maximize long-term reward. To overcome these shortcomings, this paper proposes an advanced VMP algorithm based on Dueling-DDQN. Moreover, specific optimization techniques are introduced to enhance the exploration strategy and the capability of achieving long-term reward. Experiment results show that the proposed algorithm outperforms native DQN in terms of convergence speed, Q-value estimation accuracy and stability. Meanwhile, the proposed algorithm can achieve multiple optimization goals such as reducing power consumption, ensuring resource load balance and Improving user service Quality.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"50 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dueling-DDQN Based Virtual Machine Placement Algorithm for Cloud Computing Systems\",\"authors\":\"Jiling Yan, Jianyu Xiao, Xuemin Hong\",\"doi\":\"10.1109/iccc52777.2021.9580393\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Virtual machine placement (VMP) in large-scale cloud computing clusters is a challenging problem with practical importance. Deep Q-learning (DQN) based algorithm is a promising means to solve difficult VMP problems with complex optimization goals and dynamically changing environments. However, native DQN algorithms suffer from shortcomings such as Q value overestimation, difficulty in convergence, and failure to maximize long-term reward. To overcome these shortcomings, this paper proposes an advanced VMP algorithm based on Dueling-DDQN. Moreover, specific optimization techniques are introduced to enhance the exploration strategy and the capability of achieving long-term reward. Experiment results show that the proposed algorithm outperforms native DQN in terms of convergence speed, Q-value estimation accuracy and stability. Meanwhile, the proposed algorithm can achieve multiple optimization goals such as reducing power consumption, ensuring resource load balance and Improving user service Quality.\",\"PeriodicalId\":425118,\"journal\":{\"name\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"50 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccc52777.2021.9580393\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

大规模云计算集群中的虚拟机布局(VMP)是一个具有实际意义的挑战性问题。基于深度q -学习(Deep Q-learning, DQN)的算法是解决具有复杂优化目标和动态变化环境的VMP难题的一种很有前途的方法。然而,原生DQN算法存在Q值高估、收敛困难、无法实现长期回报最大化等缺点。为了克服这些缺点,本文提出了一种基于Dueling-DDQN的VMP算法。此外,还介绍了具体的优化技术,以提高勘探策略和实现长期回报的能力。实验结果表明,该算法在收敛速度、q值估计精度和稳定性方面都优于原生DQN。同时,该算法可以实现降低功耗、保证资源负载均衡和提高用户服务质量等多个优化目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dueling-DDQN Based Virtual Machine Placement Algorithm for Cloud Computing Systems
Virtual machine placement (VMP) in large-scale cloud computing clusters is a challenging problem with practical importance. Deep Q-learning (DQN) based algorithm is a promising means to solve difficult VMP problems with complex optimization goals and dynamically changing environments. However, native DQN algorithms suffer from shortcomings such as Q value overestimation, difficulty in convergence, and failure to maximize long-term reward. To overcome these shortcomings, this paper proposes an advanced VMP algorithm based on Dueling-DDQN. Moreover, specific optimization techniques are introduced to enhance the exploration strategy and the capability of achieving long-term reward. Experiment results show that the proposed algorithm outperforms native DQN in terms of convergence speed, Q-value estimation accuracy and stability. Meanwhile, the proposed algorithm can achieve multiple optimization goals such as reducing power consumption, ensuring resource load balance and Improving user service 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学术文献互助群
群 号:481959085
Book学术官方微信