Enhancing Resource Allocation in Edge and Fog-Cloud Computing with Genetic Algorithm and Particle Swarm Optimization

Saad-Eddine Chafi;Younes Balboul;Mohammed Fattah;Said Mazer;Moulhime El Bekkali
{"title":"Enhancing Resource Allocation in Edge and Fog-Cloud Computing with Genetic Algorithm and Particle Swarm Optimization","authors":"Saad-Eddine Chafi;Younes Balboul;Mohammed Fattah;Said Mazer;Moulhime El Bekkali","doi":"10.23919/ICN.2023.0022","DOIUrl":null,"url":null,"abstract":"Evolutionary algorithms have gained significant attention from researchers as effective solutions for various optimization problems. Genetic Algorithm (GA) is widely popular due to its logical approach, broad applicability, and ability to tackle complex issues encountered in engineering systems. However, GA is known for its high implementation cost and typically requires a large number of iterations. On the other hand, Particle Swarm Optimization (PSO) is a relatively new heuristic technique inspired by the collective behaviors of real organisms. Both GA and PSO algorithms are prominent heuristic optimization methods that belong to the population-based approaches family. While they are often seen as competitors, their efficiency heavily relies on the parameter values chosen and the specific optimization problem at hand. In this study, we aim to compare the runtime performance of GA and PSO algorithms within a cutting-edge edge and fog cloud architecture. Through extensive experiments and performance evaluations, the authors demonstrate the effectiveness of GA and PSO algorithms in improving resource allocation in edge and fog cloud computing scenarios using FogWorkflowSim simulator. The comparative analysis sheds light on the strengths and limitations of each algorithm, providing valuable insights for researchers and practitioners in the field.","PeriodicalId":100681,"journal":{"name":"Intelligent and Converged Networks","volume":"4 4","pages":"273-279"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10379057","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Intelligent and Converged Networks","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10379057/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Evolutionary algorithms have gained significant attention from researchers as effective solutions for various optimization problems. Genetic Algorithm (GA) is widely popular due to its logical approach, broad applicability, and ability to tackle complex issues encountered in engineering systems. However, GA is known for its high implementation cost and typically requires a large number of iterations. On the other hand, Particle Swarm Optimization (PSO) is a relatively new heuristic technique inspired by the collective behaviors of real organisms. Both GA and PSO algorithms are prominent heuristic optimization methods that belong to the population-based approaches family. While they are often seen as competitors, their efficiency heavily relies on the parameter values chosen and the specific optimization problem at hand. In this study, we aim to compare the runtime performance of GA and PSO algorithms within a cutting-edge edge and fog cloud architecture. Through extensive experiments and performance evaluations, the authors demonstrate the effectiveness of GA and PSO algorithms in improving resource allocation in edge and fog cloud computing scenarios using FogWorkflowSim simulator. The comparative analysis sheds light on the strengths and limitations of each algorithm, providing valuable insights for researchers and practitioners in the field.
利用遗传算法和粒子群优化加强边缘和雾云计算中的资源分配
进化算法作为解决各种优化问题的有效方法,已受到研究人员的极大关注。遗传算法(GA)因其合理的方法、广泛的适用性和解决工程系统中遇到的复杂问题的能力而广受欢迎。然而,遗传算法的实施成本较高,通常需要大量的迭代。另一方面,粒子群优化(PSO)是一种相对较新的启发式技术,其灵感来源于真实生物的集体行为。GA 算法和 PSO 算法都是著名的启发式优化方法,属于基于种群的方法系列。虽然它们经常被视为竞争对手,但其效率在很大程度上取决于所选的参数值和手头的具体优化问题。在本研究中,我们旨在比较 GA 算法和 PSO 算法在尖端边缘和雾云架构中的运行性能。通过大量的实验和性能评估,作者利用 FogWorkflowSim 模拟器证明了 GA 和 PSO 算法在改善边缘和雾云计算场景中的资源分配方面的有效性。对比分析揭示了每种算法的优势和局限性,为该领域的研究人员和从业人员提供了宝贵的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信