Migration of containers on the basis of load prediction with dynamic inertia weight based PSO algorithm

Shabnam Bawa, Prashant Singh Rana, RajKumar Tekchandani
{"title":"Migration of containers on the basis of load prediction with dynamic inertia weight based PSO algorithm","authors":"Shabnam Bawa, Prashant Singh Rana, RajKumar Tekchandani","doi":"10.1007/s10586-024-04676-0","DOIUrl":null,"url":null,"abstract":"<p>Due to the necessity of virtualization in a fog environment with limited resources, service providers are challenged to reduce the energy consumption of hosts. The consolidation of virtual machines (VMs) has led to a significant amount of research into the effective management of energy usage. Due to their high computational overhead, the existing virtualization techniques may not be suited to minimize the energy consumption of fog devices. As containers have recently gained popularity for encapsulating fog services, they are an ideal candidate for addressing this issue, particularly for fog devices. In the proposed work, an ensemble model is used for load prediction on hosts to classify them as overloaded, underloaded, or balanced. A container selection algorithm identifies containers for migration when a host becomes overloaded. Additionally, an energy-efficient container migration strategy facilitated by a dynamic inertia weight-based particle swarm optimization (DIWPSO) algorithm is introduced to meet resource demands. This approach entails migrating containers from overloaded hosts to others in order to balance the load and reduce the energy consumption of hosts located on fog nodes. Experimental results demonstrate that load balancing can be achieved at a lower migration cost. The proposed DIWPSO algorithm significantly reduces energy consumption by 10.89% through container migration. Moreover, compared to meta-heuristic solutions such as PSO, ABC (Artificial Bee Colony), and E-ABC (Enhanced Artificial Bee Colony), the proposed DIWPSO algorithm shows superior performance across various evaluation parameters.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10586-024-04676-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the necessity of virtualization in a fog environment with limited resources, service providers are challenged to reduce the energy consumption of hosts. The consolidation of virtual machines (VMs) has led to a significant amount of research into the effective management of energy usage. Due to their high computational overhead, the existing virtualization techniques may not be suited to minimize the energy consumption of fog devices. As containers have recently gained popularity for encapsulating fog services, they are an ideal candidate for addressing this issue, particularly for fog devices. In the proposed work, an ensemble model is used for load prediction on hosts to classify them as overloaded, underloaded, or balanced. A container selection algorithm identifies containers for migration when a host becomes overloaded. Additionally, an energy-efficient container migration strategy facilitated by a dynamic inertia weight-based particle swarm optimization (DIWPSO) algorithm is introduced to meet resource demands. This approach entails migrating containers from overloaded hosts to others in order to balance the load and reduce the energy consumption of hosts located on fog nodes. Experimental results demonstrate that load balancing can be achieved at a lower migration cost. The proposed DIWPSO algorithm significantly reduces energy consumption by 10.89% through container migration. Moreover, compared to meta-heuristic solutions such as PSO, ABC (Artificial Bee Colony), and E-ABC (Enhanced Artificial Bee Colony), the proposed DIWPSO algorithm shows superior performance across various evaluation parameters.

Abstract Image

利用基于动态惯性权的 PSO 算法,根据载荷预测迁移集装箱
由于必须在资源有限的雾环境中实现虚拟化,服务提供商面临着降低主机能耗的挑战。虚拟机(VM)的整合引发了大量关于有效管理能源使用的研究。由于计算开销大,现有的虚拟化技术可能无法最大限度地降低雾设备的能耗。最近,用于封装雾服务的容器越来越受欢迎,因此容器是解决这一问题的理想候选方案,特别是对于雾设备而言。在提议的工作中,使用集合模型对主机进行负载预测,将其分类为过载、欠载或平衡。当主机过载时,容器选择算法会识别需要迁移的容器。此外,还引入了一种高能效的容器迁移策略,通过基于动态惯性权重的粒子群优化算法(DIWPSO)来满足资源需求。这种方法需要将容器从过载的主机迁移到其他主机,以平衡负载并降低位于雾节点上的主机的能耗。实验结果表明,可以以较低的迁移成本实现负载平衡。所提出的 DIWPSO 算法通过容器迁移将能耗显著降低了 10.89%。此外,与 PSO、ABC(人工蜂群)和 E-ABC(增强型人工蜂群)等元启发式解决方案相比,所提出的 DIWPSO 算法在各种评估参数上都表现出更优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信