Evaluation of Optimization Algorithm for Application Placement Problem in Fog Computing: A Systematic Review

IF 12.1 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Ankur Goswami, Kirit Modi, Chirag Patel
{"title":"Evaluation of Optimization Algorithm for Application Placement Problem in Fog Computing: A Systematic Review","authors":"Ankur Goswami,&nbsp;Kirit Modi,&nbsp;Chirag Patel","doi":"10.1007/s11831-025-10227-6","DOIUrl":null,"url":null,"abstract":"<div><p>Application placement in fog computing is a crucial aspect of designing and managing fog computing systems. As a consequence, optimized application management becomes an essential task. Numerous algorithms have been proposed in the literature for efficient placement of applications in fog to address the Fog Application Placement Problem (FAPP), however not much work was done in evaluation of optimization algorithms. The evaluations are needed for making practical and impactful decision that can contribute to the scalability, reliability, and cost-effectiveness of the fog. This evaluation work is targeted towards the search of most efficient algorithms for FAPP especially optimization algorithms. The evaluations presented in this work provide answers to the most essential research questions such as what is the need of optimization in fog environment, which optimization algorithm performs best and what is its future in fog computing. The evaluations in this paper firstly, focuses on metric-based evaluations, which evaluates Fog Utilization, Service Level Agreement (SLA) violation and Response time of various state of the art works collected from the literature The work also evaluates different type of Optimization algorithms and Optimization objectives side-by-side to see which type are best suited for FAPP.</p></div>","PeriodicalId":55473,"journal":{"name":"Archives of Computational Methods in Engineering","volume":"32 5","pages":"2887 - 2915"},"PeriodicalIF":12.1000,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11831-025-10227-6.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Computational Methods in Engineering","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s11831-025-10227-6","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Application placement in fog computing is a crucial aspect of designing and managing fog computing systems. As a consequence, optimized application management becomes an essential task. Numerous algorithms have been proposed in the literature for efficient placement of applications in fog to address the Fog Application Placement Problem (FAPP), however not much work was done in evaluation of optimization algorithms. The evaluations are needed for making practical and impactful decision that can contribute to the scalability, reliability, and cost-effectiveness of the fog. This evaluation work is targeted towards the search of most efficient algorithms for FAPP especially optimization algorithms. The evaluations presented in this work provide answers to the most essential research questions such as what is the need of optimization in fog environment, which optimization algorithm performs best and what is its future in fog computing. The evaluations in this paper firstly, focuses on metric-based evaluations, which evaluates Fog Utilization, Service Level Agreement (SLA) violation and Response time of various state of the art works collected from the literature The work also evaluates different type of Optimization algorithms and Optimization objectives side-by-side to see which type are best suited for FAPP.

雾计算中应用程序放置问题的优化算法评价:系统综述
雾计算中的应用程序放置是设计和管理雾计算系统的一个关键方面。因此,优化的应用程序管理成为一项基本任务。文献中已经提出了许多算法来有效地在雾中放置应用程序,以解决雾应用程序放置问题(FAPP),但是在评估优化算法方面做的工作并不多。需要进行评估才能做出实际且有影响力的决策,从而有助于雾的可伸缩性、可靠性和成本效益。本评估工作旨在寻找最有效的FAPP算法,特别是优化算法。本文提出的评价为雾环境中优化的必要性、哪种优化算法性能最好以及雾计算的未来等最基本的研究问题提供了答案。本文的评估首先侧重于基于度量的评估,评估了从文献中收集的各种最新作品的雾利用率,服务水平协议(SLA)违反和响应时间,并对不同类型的优化算法和优化目标进行了并列评估,以确定哪种类型最适合FAPP。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
19.80
自引率
4.10%
发文量
153
审稿时长
>12 weeks
期刊介绍: Archives of Computational Methods in Engineering Aim and Scope: Archives of Computational Methods in Engineering serves as an active forum for disseminating research and advanced practices in computational engineering, particularly focusing on mechanics and related fields. The journal emphasizes extended state-of-the-art reviews in selected areas, a unique feature of its publication. Review Format: Reviews published in the journal offer: A survey of current literature Critical exposition of topics in their full complexity By organizing the information in this manner, readers can quickly grasp the focus, coverage, and unique features of the Archives of Computational Methods in Engineering.
×
引用
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学术官方微信