亚当-瓢虫甲虫优化雾计算中的多目标服务安置策略

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-08-13 DOI:10.1002/cpe.8239
Oshin Sharma, Deepak Sharma
{"title":"亚当-瓢虫甲虫优化雾计算中的多目标服务安置策略","authors":"Oshin Sharma,&nbsp;Deepak Sharma","doi":"10.1002/cpe.8239","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The Internet of Things (IoT) has transformed every aspect of our lives and has become universal in multiple fields from personnel to government and military applications. However, IoT suffers from the inherent limitation of latency and high computational costs, which can be effectively overcome by using a fog computing framework. However, the key challenge in fog computing is to address the problem of service placement among the nodes, thereby providing optimal utilization of resources and minimizing service time. This research work presents a novel service placement technique, by considering the service placement issue as a multi-objective optimization problem. Here, a two-level fog computing network comprising a fog master node and fog cells is considered. The master node is responsible for the service placement of the fog nodes, and the service placement is carried out using the Adam-Ladybug Beetle Optimization (ALBO) algorithm. Further, multiple objectives, like resource utilization, makespan, response time, service time, cost, and energy consumption are considered to enhance service placement. Moreover, the efficiency of the ALBO for service placement (ALBO_SP) is examined considering service cost, energy consumption, and service time and is found to attain values of 19.009, 73.581 J, and 4.854 s, respectively.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 24","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adam-Ladybug Beetle Optimization enabled multi-objective service placement strategy in fog computing\",\"authors\":\"Oshin Sharma,&nbsp;Deepak Sharma\",\"doi\":\"10.1002/cpe.8239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>The Internet of Things (IoT) has transformed every aspect of our lives and has become universal in multiple fields from personnel to government and military applications. However, IoT suffers from the inherent limitation of latency and high computational costs, which can be effectively overcome by using a fog computing framework. However, the key challenge in fog computing is to address the problem of service placement among the nodes, thereby providing optimal utilization of resources and minimizing service time. This research work presents a novel service placement technique, by considering the service placement issue as a multi-objective optimization problem. Here, a two-level fog computing network comprising a fog master node and fog cells is considered. The master node is responsible for the service placement of the fog nodes, and the service placement is carried out using the Adam-Ladybug Beetle Optimization (ALBO) algorithm. Further, multiple objectives, like resource utilization, makespan, response time, service time, cost, and energy consumption are considered to enhance service placement. Moreover, the efficiency of the ALBO for service placement (ALBO_SP) is examined considering service cost, energy consumption, and service time and is found to attain values of 19.009, 73.581 J, and 4.854 s, respectively.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 24\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8239\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8239","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要物联网(IoT)已经改变了我们生活的方方面面,并已普及到从人事到政府和军事应用等多个领域。然而,物联网存在延迟和计算成本高的固有限制,而使用雾计算框架可以有效克服这些问题。然而,雾计算的关键挑战在于如何解决节点间的服务安置问题,从而实现资源的最佳利用和服务时间的最小化。本研究工作将服务放置问题视为一个多目标优化问题,提出了一种新颖的服务放置技术。这里考虑了一个由雾主节点和雾单元组成的两级雾计算网络。主节点负责雾节点的服务投放,服务投放采用亚当-瓢虫甲虫优化(ALBO)算法。此外,还考虑了多个目标,如资源利用率、时间跨度、响应时间、服务时间、成本和能耗,以提高服务安置的效率。此外,考虑到服务成本、能源消耗和服务时间,还考察了 ALBO 用于服务放置(ALBO_SP)的效率,发现其效率值分别为 19.009、73.581 J 和 4.854 s。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adam-Ladybug Beetle Optimization enabled multi-objective service placement strategy in fog computing

The Internet of Things (IoT) has transformed every aspect of our lives and has become universal in multiple fields from personnel to government and military applications. However, IoT suffers from the inherent limitation of latency and high computational costs, which can be effectively overcome by using a fog computing framework. However, the key challenge in fog computing is to address the problem of service placement among the nodes, thereby providing optimal utilization of resources and minimizing service time. This research work presents a novel service placement technique, by considering the service placement issue as a multi-objective optimization problem. Here, a two-level fog computing network comprising a fog master node and fog cells is considered. The master node is responsible for the service placement of the fog nodes, and the service placement is carried out using the Adam-Ladybug Beetle Optimization (ALBO) algorithm. Further, multiple objectives, like resource utilization, makespan, response time, service time, cost, and energy consumption are considered to enhance service placement. Moreover, the efficiency of the ALBO for service placement (ALBO_SP) is examined considering service cost, energy consumption, and service time and is found to attain values of 19.009, 73.581 J, and 4.854 s, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1