Hybrid Spider Monkey Optimization Mechanism with Simulated Annealing for Resource Provisioning in Cloud Environment

Q1 Mathematics
A. Archana, N. Kumar, Z. Khan
{"title":"Hybrid Spider Monkey Optimization Mechanism with Simulated Annealing for Resource Provisioning in Cloud Environment","authors":"A. Archana, N. Kumar, Z. Khan","doi":"10.5815/ijcnis.2024.01.03","DOIUrl":null,"url":null,"abstract":"Cloud computing is an emerging concept that makes better use of a large number of distributed resources. The most significant issue that affects the cloud computing environment is resource provisioning. Better performance in the shortest amount of time is an important goal in resource provisioning. Create the best solution for dynamically provisioning resources in the shortest time possible. This paper aims to perform resource provisioning with an optimal performance solution in the shortest time. Hybridization of two Meta-heuristics techniques, such as HSMOSA (Hybrid Spider Monkey Optimization with Simulated Annealing), is proposed in resource provisioning for cloud environment. Finds the global and local value using Spider Monkey Optimization's (SMO) social behavior and then utilizes Simulated Annealing (SA) to search around the global value in each iteration. As a result, the proposed approach aids in enhancing their chances of improving their position. The CloudSimPlus Simulator is used to test the proposed approach. The fitness value, execution time, throughput, mean, and standard deviation of the proposed method were calculated over various tasks and execution iterations. These performance metrics are compared with the PSO-SA algorithm. Simulation results validate the better working of the proposed HSMOSA algorithm with minimum time compared to the PSO-SA algorithm.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":"66 5","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Network and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5815/ijcnis.2024.01.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing is an emerging concept that makes better use of a large number of distributed resources. The most significant issue that affects the cloud computing environment is resource provisioning. Better performance in the shortest amount of time is an important goal in resource provisioning. Create the best solution for dynamically provisioning resources in the shortest time possible. This paper aims to perform resource provisioning with an optimal performance solution in the shortest time. Hybridization of two Meta-heuristics techniques, such as HSMOSA (Hybrid Spider Monkey Optimization with Simulated Annealing), is proposed in resource provisioning for cloud environment. Finds the global and local value using Spider Monkey Optimization's (SMO) social behavior and then utilizes Simulated Annealing (SA) to search around the global value in each iteration. As a result, the proposed approach aids in enhancing their chances of improving their position. The CloudSimPlus Simulator is used to test the proposed approach. The fitness value, execution time, throughput, mean, and standard deviation of the proposed method were calculated over various tasks and execution iterations. These performance metrics are compared with the PSO-SA algorithm. Simulation results validate the better working of the proposed HSMOSA algorithm with minimum time compared to the PSO-SA algorithm.
用于云环境资源调配的混合蜘蛛猴优化机制与模拟退火法
云计算是一个新兴概念,它能更好地利用大量分布式资源。影响云计算环境的最重要问题是资源调配。在最短时间内提高性能是资源调配的重要目标。为在最短时间内动态调配资源创建最佳解决方案。本文旨在以最佳性能解决方案在最短时间内完成资源调配。在云环境的资源调配中,提出了混合两种元启发式技术,如 HSMOSA(混合蜘蛛猴优化与模拟退火)。利用蜘蛛猴优化(SMO)的社会行为找到全局和局部值,然后利用模拟退火(SA)在每次迭代中围绕全局值进行搜索。因此,所提出的方法有助于提高它们改善自身位置的机会。CloudSimPlus 模拟器用于测试所提出的方法。在各种任务和执行迭代中,计算了拟议方法的适配值、执行时间、吞吐量、平均值和标准偏差。这些性能指标与 PSO-SA 算法进行了比较。仿真结果证实,与 PSO-SA 算法相比,拟议的 HSMOSA 算法能以最短的时间更好地工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.10
自引率
0.00%
发文量
33
×
引用
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学术官方微信