Improved deep network-based load predictor and optimal load balancing in cloud-fog services

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-09-04 DOI:10.1002/cpe.8275
Shubham Singh, Amit Kumar Mishra, Siddhartha Kumar Arjaria, Chinmay Bhatt, Daya Shankar Pandey, Ritesh Kumar Yadav
{"title":"Improved deep network-based load predictor and optimal load balancing in cloud-fog services","authors":"Shubham Singh,&nbsp;Amit Kumar Mishra,&nbsp;Siddhartha Kumar Arjaria,&nbsp;Chinmay Bhatt,&nbsp;Daya Shankar Pandey,&nbsp;Ritesh Kumar Yadav","doi":"10.1002/cpe.8275","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Cloud computing is commonly utilized in remote contexts to handle user demands for resources and services. Each assignment has unique processing needs that are determined by the time it takes to complete. However, if load balancing is not properly managed, the effectiveness of resources may suffer dramatically. Consequently, cloud service providers have to emphasize rapid and precise load balancing as well as proper resource supply. This paper proposes a novel enhanced deep network-based load predictor and load balancing in cloud-fog services. In prior, the workload is predicted using a deep network called Multiple Layers Assisted in LSTM (MLA-LSTM) model that considers the capacity of virtual machine (VM) and task as input and predicts the target label as underload, overload and equally balanced. According to this prediction, the optimal load balancing is performed through a hybrid optimization named Osprey Assisted Pelican Optimization Algorithm (OAPOA) while taking into account several parameters such as makespan, execution cost, resource consumption, and server load. Additionally, a process known as load migration is carried out, in which machines with overload tasks are assigned to machines with underload tasks. This migration is applied optimally via the OAPOA strategy under the consideration of constraints including migration cost and migration efficiency.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-09-04","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.8275","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing is commonly utilized in remote contexts to handle user demands for resources and services. Each assignment has unique processing needs that are determined by the time it takes to complete. However, if load balancing is not properly managed, the effectiveness of resources may suffer dramatically. Consequently, cloud service providers have to emphasize rapid and precise load balancing as well as proper resource supply. This paper proposes a novel enhanced deep network-based load predictor and load balancing in cloud-fog services. In prior, the workload is predicted using a deep network called Multiple Layers Assisted in LSTM (MLA-LSTM) model that considers the capacity of virtual machine (VM) and task as input and predicts the target label as underload, overload and equally balanced. According to this prediction, the optimal load balancing is performed through a hybrid optimization named Osprey Assisted Pelican Optimization Algorithm (OAPOA) while taking into account several parameters such as makespan, execution cost, resource consumption, and server load. Additionally, a process known as load migration is carried out, in which machines with overload tasks are assigned to machines with underload tasks. This migration is applied optimally via the OAPOA strategy under the consideration of constraints including migration cost and migration efficiency.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于深度网络的改进型负载预测器和云雾服务中的优化负载平衡
摘要云计算通常用于远程环境,以处理用户对资源和服务的需求。每项任务都有独特的处理需求,这些需求由完成任务所需的时间决定。但是,如果负载平衡管理不当,资源的有效性可能会大打折扣。因此,云服务提供商必须强调快速、精确的负载平衡以及适当的资源供应。本文提出了一种新颖的基于深度网络的增强型负载预测器和云雾服务中的负载平衡。该模型将虚拟机(VM)和任务的容量作为输入,并预测目标标签为欠载、过载和均衡。根据这一预测,通过名为 "Osprey Assisted Pelican Optimization Algorithm (OAPOA) "的混合优化来执行最佳负载平衡,同时考虑到一些参数,如时间跨度、执行成本、资源消耗和服务器负载。此外,还执行了一个称为负载迁移的过程,将超载任务的机器分配给负载不足的机器。这种迁移是在考虑迁移成本和迁移效率等约束条件的情况下,通过 OAPOA 策略优化应用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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