Request Deadline Split and Interference-Aware Request Migration in Edge Cloud

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Jie Wang, Huiqun Yu, Guisheng Fan, Jiayin Zhang
{"title":"Request Deadline Split and Interference-Aware Request Migration in Edge Cloud","authors":"Jie Wang,&nbsp;Huiqun Yu,&nbsp;Guisheng Fan,&nbsp;Jiayin Zhang","doi":"10.1002/cpe.8315","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Edge computing extends computing resources from the data center to the edge of the network to better handle latency-sensitive tasks. However, with the rise of the Internet of Things, edge devices with limited processing capabilities face difficulties in executing requests with fluctuating request peaks. In order to meet the deadline constraints of latency-sensitive tasks, a feasible solution is to offload some latency-sensitive tasks to other nearby edge devices. This article studies the problem of request migration in edge computing systems and minimizes the request deadline violation rate based on actual online arrival patterns, performance interference phenomena, and deadline constraints. Since a request contains multiple services and request migration will lead to changes in server resource competition pressure, we split the problem into three sub-problems, dividing the request deadline to determine the maximum response time of the service, determining the performance of the service under different resource pressures and the request migration strategies. To this end, we propose two deadline splitting methods, a performance interference model under multi-resource pressure, and two heuristic request migration strategies. Since this article considers online edge scenarios, the number and type of requests are black boxes. We conduct simulation experiments and find that our method has only one-third the number of request violations of other methods.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-24","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.8315","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

Edge computing extends computing resources from the data center to the edge of the network to better handle latency-sensitive tasks. However, with the rise of the Internet of Things, edge devices with limited processing capabilities face difficulties in executing requests with fluctuating request peaks. In order to meet the deadline constraints of latency-sensitive tasks, a feasible solution is to offload some latency-sensitive tasks to other nearby edge devices. This article studies the problem of request migration in edge computing systems and minimizes the request deadline violation rate based on actual online arrival patterns, performance interference phenomena, and deadline constraints. Since a request contains multiple services and request migration will lead to changes in server resource competition pressure, we split the problem into three sub-problems, dividing the request deadline to determine the maximum response time of the service, determining the performance of the service under different resource pressures and the request migration strategies. To this end, we propose two deadline splitting methods, a performance interference model under multi-resource pressure, and two heuristic request migration strategies. Since this article considers online edge scenarios, the number and type of requests are black boxes. We conduct simulation experiments and find that our method has only one-third the number of request violations of other methods.

边缘云中请求截止日期分割和干扰感知请求迁移
边缘计算将计算资源从数据中心扩展到网络边缘,以更好地处理对延迟敏感的任务。然而,随着物联网的兴起,处理能力有限的边缘设备在执行请求峰值波动的请求时面临困难。为了满足延迟敏感任务的时限限制,一种可行的解决方案是将一些延迟敏感任务卸载到附近的其他边缘设备上。本文研究边缘计算系统中的请求迁移问题,并基于实际在线到达模式、性能干扰现象和截止日期约束最小化请求截止日期违反率。由于一个请求包含多个服务,并且请求迁移会导致服务器资源竞争压力的变化,我们将问题分解为三个子问题,通过划分请求截止时间来确定服务的最大响应时间,确定不同资源压力下服务的性能和请求迁移策略。为此,我们提出了两种截止日期分割方法、多资源压力下的性能干扰模型和两种启发式请求迁移策略。由于本文考虑的是在线边缘场景,因此请求的数量和类型都是黑盒。我们进行了仿真实验,发现我们的方法的请求违规次数只有其他方法的三分之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
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学术官方微信