Modified Fire Hawks Gazelle Optimization (MFHGO) Algorithm Based Optimized Approach to Improve the QoS Provisioning in Cloud Computing Environment

Q4 Computer Science
M. Gupta, Devendra Singh
{"title":"Modified Fire Hawks Gazelle Optimization (MFHGO) Algorithm Based Optimized Approach to Improve the QoS Provisioning in Cloud Computing Environment","authors":"M. Gupta, Devendra Singh","doi":"10.22247/ijcna/2023/221896","DOIUrl":null,"url":null,"abstract":"– This work introduces a method that focuses on enhancing resource allocation in cloud computing environments by considering Quality of Service (QoS) factors. Since resource allocation plays a crucial role in determining the QoS of cloud services, it is important to consider indicators like response time, throughput, waiting time, and makespan. The primary difficulty in cloud computing lies in resource allocation, which can be tackled by proposing a novel algorithm known as Modified Fire Hawks Gazelle Optimization (MFHGO). The proposed approach involves the hybridization of the modified fire hawks algorithm with gazelle optimization to facilitate efficient resource allocation. It aims to optimize several objectives, such as resource utilization, degree of imbalance, completion time, throughput, relative error, and response time. To achieve this, an optimal resource allocation is achieved using the Partitioning around K-medoids (PAKM) clustering approach. The proposed model extends the K-means clustering method. For simulation purposes, the GWA-T-12 Bitbrains dataset is utilized, while the JAVA tool is employed for exploratory analysis. The effectiveness of the proposed resource allocation and clustering approach is demonstrated by comparing it with existing schemes. The proposed work's makespan is 1.45 seconds for 50 tasks, 3.6 seconds for 100 tasks, 3.67 seconds for 150 tasks, and 5.34 seconds for 200 jobs. As a result, the proposed model achieves the smallest makespan value when compared to the previous approaches. The proposed work yielded response times of 105ms for a task length of 100, 376ms for 200, 555ms for 300, 624ms for 400, and 1014ms for 500. These results indicate that the proposed model outperforms current approaches by achieving a faster response time and also attains a bandwidth utilization of 0.80%, 0.90%, and 0.97% for 4, 6, and 16 tasks, respectively, indicating better bandwidth utilization than the other approaches.","PeriodicalId":36485,"journal":{"name":"International Journal of Computer Networks and Applications","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Networks and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22247/ijcna/2023/221896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

– This work introduces a method that focuses on enhancing resource allocation in cloud computing environments by considering Quality of Service (QoS) factors. Since resource allocation plays a crucial role in determining the QoS of cloud services, it is important to consider indicators like response time, throughput, waiting time, and makespan. The primary difficulty in cloud computing lies in resource allocation, which can be tackled by proposing a novel algorithm known as Modified Fire Hawks Gazelle Optimization (MFHGO). The proposed approach involves the hybridization of the modified fire hawks algorithm with gazelle optimization to facilitate efficient resource allocation. It aims to optimize several objectives, such as resource utilization, degree of imbalance, completion time, throughput, relative error, and response time. To achieve this, an optimal resource allocation is achieved using the Partitioning around K-medoids (PAKM) clustering approach. The proposed model extends the K-means clustering method. For simulation purposes, the GWA-T-12 Bitbrains dataset is utilized, while the JAVA tool is employed for exploratory analysis. The effectiveness of the proposed resource allocation and clustering approach is demonstrated by comparing it with existing schemes. The proposed work's makespan is 1.45 seconds for 50 tasks, 3.6 seconds for 100 tasks, 3.67 seconds for 150 tasks, and 5.34 seconds for 200 jobs. As a result, the proposed model achieves the smallest makespan value when compared to the previous approaches. The proposed work yielded response times of 105ms for a task length of 100, 376ms for 200, 555ms for 300, 624ms for 400, and 1014ms for 500. These results indicate that the proposed model outperforms current approaches by achieving a faster response time and also attains a bandwidth utilization of 0.80%, 0.90%, and 0.97% for 4, 6, and 16 tasks, respectively, indicating better bandwidth utilization than the other approaches.
基于改进火鹰瞪羚优化(MFHGO)算法的云计算环境下QoS提供优化方法
-本工作介绍了一种通过考虑服务质量(QoS)因素来增强云计算环境中资源分配的方法。由于资源分配在确定云服务的QoS方面起着至关重要的作用,因此考虑响应时间、吞吐量、等待时间和完工时间等指标非常重要。云计算的主要困难在于资源分配,这可以通过提出一种称为改进火鹰瞪羚优化(MFHGO)的新算法来解决。该方法将改进的火鹰算法与瞪羚优化算法相结合,以促进资源的有效分配。它旨在优化几个目标,如资源利用率、不平衡程度、完成时间、吞吐量、相对误差和响应时间。为了实现这一点,使用围绕k - medioids的分区(PAKM)聚类方法实现了最优资源分配。该模型扩展了k均值聚类方法。为了模拟目的,我们使用了GWA-T-12 Bitbrains数据集,并使用JAVA工具进行探索性分析。通过与现有方案的比较,验证了所提出的资源分配和聚类方法的有效性。对于50个任务,建议工作的makespan为1.45秒,对于100个任务为3.6秒,对于150个任务为3.67秒,对于200个任务为5.34秒。因此,与之前的方法相比,建议的模型实现了最小的makespan值。对于任务长度为100、200、300、400和500,建议的工作产生的响应时间分别为105ms、376ms、555ms、624ms和1014ms。这些结果表明,所提出的模型通过实现更快的响应时间而优于当前方法,并且在4、6和16个任务上分别实现了0.80%、0.90%和0.97%的带宽利用率,表明比其他方法具有更好的带宽利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computer Networks and Applications
International Journal of Computer Networks and Applications Computer Science-Computer Science Applications
CiteScore
2.30
自引率
0.00%
发文量
40
×
引用
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学术官方微信