车辆边缘计算网络中的联合任务卸载与调度算法

IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Cloud Computing-Advances Systems and Applications Pub Date : 2023-07-01 DOI:10.1109/CSCloud-EdgeCom58631.2023.00061
Chongjing Huang, Q. Fu, Chaoliang Wang, Zhaohui Li
{"title":"车辆边缘计算网络中的联合任务卸载与调度算法","authors":"Chongjing Huang, Q. Fu, Chaoliang Wang, Zhaohui Li","doi":"10.1109/CSCloud-EdgeCom58631.2023.00061","DOIUrl":null,"url":null,"abstract":"The rapid development of in-vehicle intelligent applications brings difficulties to traditional cloud computing in vehicular networks. Due to the long transmission distance between vehicles and cloud centers and the instability of communication links easily lead to high latency and low reliability. Vehicle edge computing (VEC), as a new computing paradigm, can improve vehicle quality of service by offloading tasks to edge servers with abundant computational resources. This paper studied a task offloading algorithm that efficiently optimize the delay cost and operating cost in a multi-user, multi-server VEC scenario. The algorithm solves the problem of execution location of computational tasks and execution order on the servers. In this paper, we simulate a real scenario where vehicles generate tasks through time lapse and the set of tasks is unknown in advance. The task set is preprocessed using a greedy algorithm and the offloading decision is further optimized using an optimization algorithm based on simulated annealing algorithm and heuristic rules. The simulation results show that compared with the traditional baseline algorithm, our algorithm effectively improves the task offloading utility of the VEC system.","PeriodicalId":56007,"journal":{"name":"Journal of Cloud Computing-Advances Systems and Applications","volume":"1 1","pages":"318-323"},"PeriodicalIF":3.7000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint Task Offloading and Scheduling Algorithm in Vehicular Edge Computing Networks\",\"authors\":\"Chongjing Huang, Q. Fu, Chaoliang Wang, Zhaohui Li\",\"doi\":\"10.1109/CSCloud-EdgeCom58631.2023.00061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid development of in-vehicle intelligent applications brings difficulties to traditional cloud computing in vehicular networks. Due to the long transmission distance between vehicles and cloud centers and the instability of communication links easily lead to high latency and low reliability. Vehicle edge computing (VEC), as a new computing paradigm, can improve vehicle quality of service by offloading tasks to edge servers with abundant computational resources. This paper studied a task offloading algorithm that efficiently optimize the delay cost and operating cost in a multi-user, multi-server VEC scenario. The algorithm solves the problem of execution location of computational tasks and execution order on the servers. In this paper, we simulate a real scenario where vehicles generate tasks through time lapse and the set of tasks is unknown in advance. The task set is preprocessed using a greedy algorithm and the offloading decision is further optimized using an optimization algorithm based on simulated annealing algorithm and heuristic rules. The simulation results show that compared with the traditional baseline algorithm, our algorithm effectively improves the task offloading utility of the VEC system.\",\"PeriodicalId\":56007,\"journal\":{\"name\":\"Journal of Cloud Computing-Advances Systems and Applications\",\"volume\":\"1 1\",\"pages\":\"318-323\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Cloud Computing-Advances Systems and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00061\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Cloud Computing-Advances Systems and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCloud-EdgeCom58631.2023.00061","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

车载智能应用的快速发展给车载网络中的传统云计算带来了困难。由于车辆与云中心之间的传输距离较长,通信链路不稳定,容易导致高延迟和低可靠性。车辆边缘计算(VEC)作为一种新的计算范式,通过将任务卸载到计算资源丰富的边缘服务器上,可以提高车辆的服务质量。研究了一种多用户、多服务器VEC场景下有效优化延迟成本和运行成本的任务卸载算法。该算法解决了计算任务在服务器上的执行位置和执行顺序问题。在本文中,我们模拟了一个真实的场景,其中车辆通过时间推移生成任务,并且任务集事先未知。使用贪心算法对任务集进行预处理,并使用基于模拟退火算法和启发式规则的优化算法对卸载决策进行进一步优化。仿真结果表明,与传统的基线算法相比,该算法有效地提高了VEC系统的任务卸载利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint Task Offloading and Scheduling Algorithm in Vehicular Edge Computing Networks
The rapid development of in-vehicle intelligent applications brings difficulties to traditional cloud computing in vehicular networks. Due to the long transmission distance between vehicles and cloud centers and the instability of communication links easily lead to high latency and low reliability. Vehicle edge computing (VEC), as a new computing paradigm, can improve vehicle quality of service by offloading tasks to edge servers with abundant computational resources. This paper studied a task offloading algorithm that efficiently optimize the delay cost and operating cost in a multi-user, multi-server VEC scenario. The algorithm solves the problem of execution location of computational tasks and execution order on the servers. In this paper, we simulate a real scenario where vehicles generate tasks through time lapse and the set of tasks is unknown in advance. The task set is preprocessed using a greedy algorithm and the offloading decision is further optimized using an optimization algorithm based on simulated annealing algorithm and heuristic rules. The simulation results show that compared with the traditional baseline algorithm, our algorithm effectively improves the task offloading utility of the VEC system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Cloud Computing-Advances Systems and Applications
Journal of Cloud Computing-Advances Systems and Applications Computer Science-Computer Networks and Communications
CiteScore
6.80
自引率
7.50%
发文量
76
审稿时长
75 days
期刊介绍: The Journal of Cloud Computing: Advances, Systems and Applications (JoCCASA) will publish research articles on all aspects of Cloud Computing. Principally, articles will address topics that are core to Cloud Computing, focusing on the Cloud applications, the Cloud systems, and the advances that will lead to the Clouds of the future. Comprehensive review and survey articles that offer up new insights, and lay the foundations for further exploratory and experimental work, are also relevant.
期刊最新文献
Research on electromagnetic vibration energy harvester for cloud-edge-end collaborative architecture in power grid FedEem: a fairness-based asynchronous federated learning mechanism Adaptive device sampling and deadline determination for cloud-based heterogeneous federated learning Review on the application of cloud computing in the sports industry Improving cloud storage and privacy security for digital twin based medical records
×
引用
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