An Enhanced Process Scheduler Using Multi-Access Edge Computing in An IoT Network

Q1 Mathematics
P. S., S. Kuzhalvaimozhi, Bhuvan K., Ramitha R., Tanisha Machaiah M.
{"title":"An Enhanced Process Scheduler Using Multi-Access Edge Computing in An IoT Network","authors":"P. S., S. Kuzhalvaimozhi, Bhuvan K., Ramitha R., Tanisha Machaiah M.","doi":"10.5815/ijcnis.2024.04.09","DOIUrl":null,"url":null,"abstract":"Multi-access edge computing has the ability to provide high bandwidth, and low latency, ensuring high efficiency in performing network operations and thus, it seems to be promising in the technical field. MEC allows processing and analysis of data at the network edges but it has finite number of resources which can be used. To overcome this restriction, a scheduling algorithm can be used by an orchestrator to deliver high quality services by choosing when and where each process should be executed. The scheduling algorithm must meet the expected outcome by utilizing lesser number of resources. This paper provides a scheduling algorithm containing two cooperative levels with an orchestrator layer acting at the center. The first level schedules local processes on the MEC servers and the next layer represents the orchestrator and allocates processes to nearby stations or cloud. Depending on latency and throughput, the processes are executed according to their priority. A resource optimization algorithm has also been proposed for extra performance. This offers a cost-efficient solution which provides good service availability. The proposed algorithm has a balanced wait time (Avg) and blocking percentage (Avg) of 2.37ms and 0.4 respectively. The blocking percentage is 1.65 times better than Shortest Job First Scheduling (SJFS) and 1.3 times better than Earliest Deadline First Scheduling (EDFS). The optimization algorithm can work on many kinds of network traffic models such as uniformly distributed and base stations with unbalanced loads.","PeriodicalId":36488,"journal":{"name":"International Journal of Computer Network and Information Security","volume":"18 12","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Network and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5815/ijcnis.2024.04.09","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-access edge computing has the ability to provide high bandwidth, and low latency, ensuring high efficiency in performing network operations and thus, it seems to be promising in the technical field. MEC allows processing and analysis of data at the network edges but it has finite number of resources which can be used. To overcome this restriction, a scheduling algorithm can be used by an orchestrator to deliver high quality services by choosing when and where each process should be executed. The scheduling algorithm must meet the expected outcome by utilizing lesser number of resources. This paper provides a scheduling algorithm containing two cooperative levels with an orchestrator layer acting at the center. The first level schedules local processes on the MEC servers and the next layer represents the orchestrator and allocates processes to nearby stations or cloud. Depending on latency and throughput, the processes are executed according to their priority. A resource optimization algorithm has also been proposed for extra performance. This offers a cost-efficient solution which provides good service availability. The proposed algorithm has a balanced wait time (Avg) and blocking percentage (Avg) of 2.37ms and 0.4 respectively. The blocking percentage is 1.65 times better than Shortest Job First Scheduling (SJFS) and 1.3 times better than Earliest Deadline First Scheduling (EDFS). The optimization algorithm can work on many kinds of network traffic models such as uniformly distributed and base stations with unbalanced loads.
物联网网络中使用多接入边缘计算的增强型进程调度器
多访问边缘计算能够提供高带宽和低延迟,确保高效执行网络操作,因此在技术领域前景广阔。多访问边缘计算允许在网络边缘处理和分析数据,但可使用的资源数量有限。为了克服这一限制,协调者可以使用调度算法来选择每个进程的执行时间和地点,从而提供高质量的服务。调度算法必须通过利用较少的资源达到预期结果。本文提供了一种调度算法,它包含两个合作层,以协调者层为中心。第一层在 MEC 服务器上调度本地进程,下一层代表协调者,将进程分配到附近的站点或云上。根据延迟和吞吐量,进程按照优先级执行。为提高性能,还提出了一种资源优化算法。这提供了一种具有成本效益的解决方案,可提供良好的服务可用性。拟议算法的平衡等待时间(平均值)和阻塞百分比(平均值)分别为 2.37ms 和 0.4。阻塞百分比是最短作业优先调度(SJFS)的 1.65 倍,是最早截止时间优先调度(EDFS)的 1.3 倍。该优化算法适用于多种网络流量模型,如均匀分布和不平衡负载的基站。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.10
自引率
0.00%
发文量
33
×
引用
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学术官方微信