Dynamic OBL-driven whale optimization algorithm for independent tasks offloading in fog computing

IF 3 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zulfiqar Ali Khan, Izzatdin Abdul Aziz
{"title":"Dynamic OBL-driven whale optimization algorithm for independent tasks offloading in fog computing","authors":"Zulfiqar Ali Khan,&nbsp;Izzatdin Abdul Aziz","doi":"10.1016/j.hcc.2025.100317","DOIUrl":null,"url":null,"abstract":"<div><div>Cloud computing has been the core infrastructure for providing services to the offloaded workloads from IoT devices. However, for time-sensitive tasks, reducing end-to-end delay is a major concern. With advancements in the IoT industry, the computation requirements of incoming tasks at the cloud are escalating, resulting in compromised quality of service. Fog computing emerged to alleviate such issues. However, the resources at the fog layer are limited and require efficient usage. The Whale Optimization Algorithm is a promising meta-heuristic algorithm extensively used to solve various optimization problems. However, being an exploitation-driven technique, its exploration potential is limited, resulting in reduced solution diversity, local optima, and poor convergence. To address these issues, this study proposes a dynamic opposition learning approach to enhance the Whale Optimization Algorithm to offload independent tasks. Opposition-Based Learning (OBL) has been extensively used to improve the exploration capability of the Whale Optimization Algorithm. However, it is computationally expensive and requires efficient utilization of appropriate OBL strategies to fully realize its advantages. Therefore, our proposed algorithm employs three OBL strategies at different stages to minimize end-to-end delay and improve load balancing during task offloading. First, basic OBL and quasi-OBL are employed during population initialization. Then, the proposed dynamic partial-opposition method enhances search space exploration using an information-based triggering mechanism that tracks the status of each agent. The results illustrate significant performance improvements by the proposed algorithm compared to SACO, PSOGA, IPSO, and oppoCWOA using the NASA Ames iPSC and HPC2N workload datasets.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 4","pages":"Article 100317"},"PeriodicalIF":3.0000,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"High-Confidence Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667295225000212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing has been the core infrastructure for providing services to the offloaded workloads from IoT devices. However, for time-sensitive tasks, reducing end-to-end delay is a major concern. With advancements in the IoT industry, the computation requirements of incoming tasks at the cloud are escalating, resulting in compromised quality of service. Fog computing emerged to alleviate such issues. However, the resources at the fog layer are limited and require efficient usage. The Whale Optimization Algorithm is a promising meta-heuristic algorithm extensively used to solve various optimization problems. However, being an exploitation-driven technique, its exploration potential is limited, resulting in reduced solution diversity, local optima, and poor convergence. To address these issues, this study proposes a dynamic opposition learning approach to enhance the Whale Optimization Algorithm to offload independent tasks. Opposition-Based Learning (OBL) has been extensively used to improve the exploration capability of the Whale Optimization Algorithm. However, it is computationally expensive and requires efficient utilization of appropriate OBL strategies to fully realize its advantages. Therefore, our proposed algorithm employs three OBL strategies at different stages to minimize end-to-end delay and improve load balancing during task offloading. First, basic OBL and quasi-OBL are employed during population initialization. Then, the proposed dynamic partial-opposition method enhances search space exploration using an information-based triggering mechanism that tracks the status of each agent. The results illustrate significant performance improvements by the proposed algorithm compared to SACO, PSOGA, IPSO, and oppoCWOA using the NASA Ames iPSC and HPC2N workload datasets.
雾计算中独立任务卸载的动态obl驱动鲸鱼优化算法
云计算一直是为从物联网设备卸载的工作负载提供服务的核心基础设施。然而,对于时间敏感的任务,减少端到端延迟是一个主要问题。随着物联网行业的发展,云端传入任务的计算需求不断升级,导致服务质量下降。雾计算的出现就是为了缓解这些问题。然而,雾层的资源是有限的,需要有效利用。鲸鱼优化算法是一种很有前途的元启发式算法,广泛用于解决各种优化问题。然而,作为一种开发驱动的技术,其勘探潜力有限,导致解的多样性降低,局部最优,收敛性差。为了解决这些问题,本研究提出了一种动态对立学习方法来增强鲸鱼优化算法以卸载独立任务。基于对立的学习(OBL)被广泛用于提高鲸鱼优化算法的探索能力。然而,它的计算成本很高,需要有效地利用适当的OBL策略才能充分发挥其优势。因此,我们提出的算法在不同的阶段采用了三种OBL策略,以最小化端到端延迟,提高任务卸载过程中的负载均衡。首先,在种群初始化过程中使用基本OBL和准OBL。然后,提出的动态部分对抗方法利用基于信息的触发机制来跟踪每个代理的状态,从而增强搜索空间的探索能力。使用NASA Ames iPSC和HPC2N工作负载数据集,结果表明,与SACO、PSOGA、IPSO和oppoCWOA相比,该算法的性能有了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.70
自引率
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学术官方微信