Hybrid Markov chain-based dynamic scheduling to improve load balancing performance in fog-cloud environment

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Sustainable Computing-Informatics & Systems Pub Date : 2025-01-01 DOI:10.1016/j.suscom.2024.101077
Navid Khaledian , Shiva Razzaghzadeh , Zeynab Haghbayan , Marcus Völp
{"title":"Hybrid Markov chain-based dynamic scheduling to improve load balancing performance in fog-cloud environment","authors":"Navid Khaledian ,&nbsp;Shiva Razzaghzadeh ,&nbsp;Zeynab Haghbayan ,&nbsp;Marcus Völp","doi":"10.1016/j.suscom.2024.101077","DOIUrl":null,"url":null,"abstract":"<div><div>Fog computing is a distributed computing paradigm that has become essential for driving Internet of Things (IoT) applications due to its ability to meet the low latency requirements of increasing IoT applications. However, fog servers can become overburdened as many IoT applications need to run on these resources, potentially leading to decreased responsiveness. Additionally, the need to handle real-world challenges such as load instability, makespan, and underutilization of virtual machine (VM) devices has driven an exponential increase in demand for effective task scheduling in IoT-based fog and cloud computing environments. Therefore, scheduling IoT applications in heterogeneous fog computing systems effectively and flexibly is crucial. The limited processing resources of fog servers make the application of ideal but computationally costly procedures more challenging. To address these difficulties, we propose using an Arithmetic Optimization Algorithm (AOA) for task scheduling and a Markov chain to forecast the load of VMs as fog and cloud layer resources. This approach aims to establish an environmentally load-balanced framework that reduces energy usage and delay. The simulation results indicate that the proposed method can improve the average makespan, delay, and Performance Improvement Rate (PIR) by 8.29 %, 11.72 %, and 4.66 %, respectively, compared to the crow, firefly, and grey wolf algorithms (GWA).</div></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"45 ","pages":"Article 101077"},"PeriodicalIF":3.8000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537924001227","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Fog computing is a distributed computing paradigm that has become essential for driving Internet of Things (IoT) applications due to its ability to meet the low latency requirements of increasing IoT applications. However, fog servers can become overburdened as many IoT applications need to run on these resources, potentially leading to decreased responsiveness. Additionally, the need to handle real-world challenges such as load instability, makespan, and underutilization of virtual machine (VM) devices has driven an exponential increase in demand for effective task scheduling in IoT-based fog and cloud computing environments. Therefore, scheduling IoT applications in heterogeneous fog computing systems effectively and flexibly is crucial. The limited processing resources of fog servers make the application of ideal but computationally costly procedures more challenging. To address these difficulties, we propose using an Arithmetic Optimization Algorithm (AOA) for task scheduling and a Markov chain to forecast the load of VMs as fog and cloud layer resources. This approach aims to establish an environmentally load-balanced framework that reduces energy usage and delay. The simulation results indicate that the proposed method can improve the average makespan, delay, and Performance Improvement Rate (PIR) by 8.29 %, 11.72 %, and 4.66 %, respectively, compared to the crow, firefly, and grey wolf algorithms (GWA).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
期刊最新文献
Novel sustainable green transportation: A neutrosophic multi-objective model considering various factors in logistics Federated learning at the edge in Industrial Internet of Things: A review Enhancing economic and environmental performance of energy communities: A multi-objective optimization approach with mountain gazelle optimizer Energy consumption and workload prediction for edge nodes in the Computing Continuum Secured Energy Efficient Chaotic Gazelle based Optimized Routing Protocol in mobile ad-hoc network
×
引用
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