A Bio inspired Approach for Load Balancing in Container as a Service Cloud Computing Model

Kodanda Dhar Naik, R. R. Sahoo, S. K. Kuanar
{"title":"A Bio inspired Approach for Load Balancing in Container as a Service Cloud Computing Model","authors":"Kodanda Dhar Naik, R. R. Sahoo, S. K. Kuanar","doi":"10.47392/irjash.2023.s058","DOIUrl":null,"url":null,"abstract":"In recent years, container-based virtualization has gained popularity due to its ease of deployment and agility in cloud resource provisioning. The traditional virtual machine (VM) is based on modern innovation, has superseded technology in cloud computing which is known as containerization technology, and it is superior in terms of overall performance, reliability and efficiency. Containerized clouds deliver superior performance because they make the most of the resources available at the host level and make use of a load-balancing strategy. In order to accomplish this goal, the focus of this article is on equitably dividing of the workload across all of the available servers. In this research, we proposed a Honeybee Mating Algorithm (HBMA) to combat the issue of load balancing in the container-based cloud environment by considering the deadline of tasks. We compared our findings to those of the Grey Wolf Optimization (GWO), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) Algorithms. We assessed the performance of the proposed methods by considering the impact of parameters such as load variation and makespan. According to the findings of our proposed method, almost the tasks were com-pleted within the deadline, and the HBMA performed significantly better than any of the other strategies in terms of load variance and makespan.","PeriodicalId":244861,"journal":{"name":"International Research Journal on Advanced Science Hub","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Research Journal on Advanced Science Hub","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47392/irjash.2023.s058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, container-based virtualization has gained popularity due to its ease of deployment and agility in cloud resource provisioning. The traditional virtual machine (VM) is based on modern innovation, has superseded technology in cloud computing which is known as containerization technology, and it is superior in terms of overall performance, reliability and efficiency. Containerized clouds deliver superior performance because they make the most of the resources available at the host level and make use of a load-balancing strategy. In order to accomplish this goal, the focus of this article is on equitably dividing of the workload across all of the available servers. In this research, we proposed a Honeybee Mating Algorithm (HBMA) to combat the issue of load balancing in the container-based cloud environment by considering the deadline of tasks. We compared our findings to those of the Grey Wolf Optimization (GWO), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) Algorithms. We assessed the performance of the proposed methods by considering the impact of parameters such as load variation and makespan. According to the findings of our proposed method, almost the tasks were com-pleted within the deadline, and the HBMA performed significantly better than any of the other strategies in terms of load variance and makespan.
容器即服务云计算模型中负载平衡的生物启发方法
近年来,基于容器的虚拟化由于其易于部署和在云资源供应方面的敏捷性而越来越受欢迎。传统的虚拟机(VM)是在现代创新的基础上发展起来的,它已经取代了云计算中的容器化技术,在整体性能、可靠性和效率方面都具有优势。容器化云提供了卓越的性能,因为它们在主机级别上充分利用了可用的资源,并利用了负载平衡策略。为了实现这一目标,本文的重点是在所有可用服务器上公平地分配工作负载。在这项研究中,我们提出了一种蜜蜂交配算法(HBMA),通过考虑任务的截止日期来解决基于容器的云环境中的负载平衡问题。我们将研究结果与灰狼优化(GWO)、遗传算法(GA)和粒子群优化(PSO)算法进行了比较。我们通过考虑负载变化和最大完工时间等参数的影响来评估所提出方法的性能。研究结果表明,几乎所有任务都在期限内完成,HBMA策略在负荷方差和完工时间方面的表现明显优于其他策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信