基于下降邻域DBSCAN算法的无监督学习数据中心多维管理策略

IF 10.4 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Industrial Information Integration Pub Date : 2025-05-01 Epub Date: 2025-03-10 DOI:10.1016/j.jii.2025.100830
Bin Liang, Junqing Bai
{"title":"基于下降邻域DBSCAN算法的无监督学习数据中心多维管理策略","authors":"Bin Liang,&nbsp;Junqing Bai","doi":"10.1016/j.jii.2025.100830","DOIUrl":null,"url":null,"abstract":"<div><div>Cloud users rent virtual machines (VMs) with varying parameters tailored to their unique business requirements. These diverse VM parameters add complexity to data center (DC) management strategies. Among the crucial parameters are CPU and memory, which must be optimized to ensure efficient physical resource utilization and decreased DC energy consumption. This article proposes three algorithms to manage and optimize VMs. Firstly, the density-based spatial clustering of applications with noise (DBSCAN) algorithm is enhanced, leading to the introduction of the descending neighborhood DBSCAN (DNDBSCAN) algorithm. This algorithm facilitates the clustering of physical machines (PMs). Secondly, the cluster center nearest classification algorithm (CCN) is proposed, leveraging VM attributes and the remaining capacity of the cluster center to classify the VMs for deployment. Additionally, the avoid hot spot time correlation algorithm (AHTC) is introduced to handle VM mapping, deploying VMs on the most time-relevant PMs while mitigating hot spots. Lastly, these three algorithms are integrated into a DC multidimensional management strategy based on the DNDBSCAN algorithm within the framework of unsupervised learning (DND). When compared to other algorithms, the DND algorithm demonstrates significant improvement in PM balanced utilization and reduction of DC energy consumption. The average balanced utilization of PM of the DND algorithm is 86 %, which is an average improvement of 11 % compared to the comparative algorithm. The average total energy consumption of the DND algorithm is 124 kW•h, which is an average reduction of 41 % compared to the comparative algorithm.</div></div>","PeriodicalId":55975,"journal":{"name":"Journal of Industrial Information Integration","volume":"45 ","pages":"Article 100830"},"PeriodicalIF":10.4000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data center multidimensional management strategy based on descending neighborhood DBSCAN algorithm in unsupervised learning\",\"authors\":\"Bin Liang,&nbsp;Junqing Bai\",\"doi\":\"10.1016/j.jii.2025.100830\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Cloud users rent virtual machines (VMs) with varying parameters tailored to their unique business requirements. These diverse VM parameters add complexity to data center (DC) management strategies. Among the crucial parameters are CPU and memory, which must be optimized to ensure efficient physical resource utilization and decreased DC energy consumption. This article proposes three algorithms to manage and optimize VMs. Firstly, the density-based spatial clustering of applications with noise (DBSCAN) algorithm is enhanced, leading to the introduction of the descending neighborhood DBSCAN (DNDBSCAN) algorithm. This algorithm facilitates the clustering of physical machines (PMs). Secondly, the cluster center nearest classification algorithm (CCN) is proposed, leveraging VM attributes and the remaining capacity of the cluster center to classify the VMs for deployment. Additionally, the avoid hot spot time correlation algorithm (AHTC) is introduced to handle VM mapping, deploying VMs on the most time-relevant PMs while mitigating hot spots. Lastly, these three algorithms are integrated into a DC multidimensional management strategy based on the DNDBSCAN algorithm within the framework of unsupervised learning (DND). When compared to other algorithms, the DND algorithm demonstrates significant improvement in PM balanced utilization and reduction of DC energy consumption. The average balanced utilization of PM of the DND algorithm is 86 %, which is an average improvement of 11 % compared to the comparative algorithm. The average total energy consumption of the DND algorithm is 124 kW•h, which is an average reduction of 41 % compared to the comparative algorithm.</div></div>\",\"PeriodicalId\":55975,\"journal\":{\"name\":\"Journal of Industrial Information Integration\",\"volume\":\"45 \",\"pages\":\"Article 100830\"},\"PeriodicalIF\":10.4000,\"publicationDate\":\"2025-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Industrial Information Integration\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2452414X25000548\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/3/10 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Industrial Information Integration","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2452414X25000548","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/10 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

云用户租用具有不同参数的虚拟机(vm),以满足其独特的业务需求。这些不同的虚拟机参数增加了数据中心管理策略的复杂性。其中最关键的参数是CPU和内存,必须对其进行优化,以确保高效的物理资源利用和降低直流能耗。本文提出了三种算法来管理和优化虚拟机。首先,对基于密度的带噪声应用空间聚类(DBSCAN)算法进行了改进,引入了降邻域DBSCAN算法;该算法有利于物理机的聚类。其次,提出了集群中心最近分类算法(CCN),利用虚拟机属性和集群中心的剩余容量对待部署的虚拟机进行分类;此外,引入避免热点时间相关算法(AHTC)来处理虚拟机映射,在减少热点的同时将虚拟机部署在与时间最相关的pm上。最后,在无监督学习(DND)框架下,将这三种算法集成到基于DNDBSCAN算法的数据中心多维管理策略中。与其他算法相比,DND算法在PM均衡利用率和降低直流能耗方面有显著提高。DND算法对PM的平均均衡利用率为86%,比比较算法平均提高11%。DND算法的平均总能耗为124 kW•h,比对比算法平均降低41%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Data center multidimensional management strategy based on descending neighborhood DBSCAN algorithm in unsupervised learning
Cloud users rent virtual machines (VMs) with varying parameters tailored to their unique business requirements. These diverse VM parameters add complexity to data center (DC) management strategies. Among the crucial parameters are CPU and memory, which must be optimized to ensure efficient physical resource utilization and decreased DC energy consumption. This article proposes three algorithms to manage and optimize VMs. Firstly, the density-based spatial clustering of applications with noise (DBSCAN) algorithm is enhanced, leading to the introduction of the descending neighborhood DBSCAN (DNDBSCAN) algorithm. This algorithm facilitates the clustering of physical machines (PMs). Secondly, the cluster center nearest classification algorithm (CCN) is proposed, leveraging VM attributes and the remaining capacity of the cluster center to classify the VMs for deployment. Additionally, the avoid hot spot time correlation algorithm (AHTC) is introduced to handle VM mapping, deploying VMs on the most time-relevant PMs while mitigating hot spots. Lastly, these three algorithms are integrated into a DC multidimensional management strategy based on the DNDBSCAN algorithm within the framework of unsupervised learning (DND). When compared to other algorithms, the DND algorithm demonstrates significant improvement in PM balanced utilization and reduction of DC energy consumption. The average balanced utilization of PM of the DND algorithm is 86 %, which is an average improvement of 11 % compared to the comparative algorithm. The average total energy consumption of the DND algorithm is 124 kW•h, which is an average reduction of 41 % compared to the comparative algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Industrial Information Integration
Journal of Industrial Information Integration Decision Sciences-Information Systems and Management
CiteScore
22.30
自引率
13.40%
发文量
100
期刊介绍: The Journal of Industrial Information Integration focuses on the industry's transition towards industrial integration and informatization, covering not only hardware and software but also information integration. It serves as a platform for promoting advances in industrial information integration, addressing challenges, issues, and solutions in an interdisciplinary forum for researchers, practitioners, and policy makers. The Journal of Industrial Information Integration welcomes papers on foundational, technical, and practical aspects of industrial information integration, emphasizing the complex and cross-disciplinary topics that arise in industrial integration. Techniques from mathematical science, computer science, computer engineering, electrical and electronic engineering, manufacturing engineering, and engineering management are crucial in this context.
期刊最新文献
How to improve ship energy efficiency under data-scarce scenarios: An advanced pathway enabled by intelligent sample augmentation Information integration for Industry 5.0: A review of IIoT–edge–cloud architectures with 6G/ISAC capabilities Job-shop scheduling with resource flexibility: A systematic review from traditional to AI-integrated approaches Human-Centric automation to intelligent information integration: A mixed-methods framework for industry 5.0 manufacturing Component-level multi-lifecycle end-of-life framework, enhancing sustainability and profitability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1