基于时序IIoT应用的边缘计算联合任务卸载和虚拟机放置

Mingzhu Qiang, Changyan Yi, Juan Li, Kun Zhu, Jun Cai
{"title":"基于时序IIoT应用的边缘计算联合任务卸载和虚拟机放置","authors":"Mingzhu Qiang, Changyan Yi, Juan Li, Kun Zhu, Jun Cai","doi":"10.1109/ISCC55528.2022.9912930","DOIUrl":null,"url":null,"abstract":"In this paper, a multi-layer edge computing frame-work for the virtual machine (VM) placement and computation offloading in industrial Internet of Things (IIoT) is proposed. Unlike most existing works, we focus on addressing the temporal dependency among tasks in an IIoT task flow, and consider that there is a stringent requirement on its completion time (including the transmission time, computation time and waiting time). For striking a balance between the system completion time and the energy consumption while satisfying the storage capacity of edge servers (ESs), completion deadline of time-sequential task flows, and placement requirements of VMs, we design a many-to-one matching game (MGVDA) to jointly determine the optimal VM placement and task offloading decisions. Finally, we prove that the resulted matching game solution is effective and stable. Simulation results examine the efficiency of the proposed MGVDA and show its superiority over the counterparts.","PeriodicalId":309606,"journal":{"name":"2022 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Joint Task Offloading and VM Placement for Edge Computing with Time-Sequential IIoT Applications\",\"authors\":\"Mingzhu Qiang, Changyan Yi, Juan Li, Kun Zhu, Jun Cai\",\"doi\":\"10.1109/ISCC55528.2022.9912930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a multi-layer edge computing frame-work for the virtual machine (VM) placement and computation offloading in industrial Internet of Things (IIoT) is proposed. Unlike most existing works, we focus on addressing the temporal dependency among tasks in an IIoT task flow, and consider that there is a stringent requirement on its completion time (including the transmission time, computation time and waiting time). For striking a balance between the system completion time and the energy consumption while satisfying the storage capacity of edge servers (ESs), completion deadline of time-sequential task flows, and placement requirements of VMs, we design a many-to-one matching game (MGVDA) to jointly determine the optimal VM placement and task offloading decisions. Finally, we prove that the resulted matching game solution is effective and stable. Simulation results examine the efficiency of the proposed MGVDA and show its superiority over the counterparts.\",\"PeriodicalId\":309606,\"journal\":{\"name\":\"2022 IEEE Symposium on Computers and Communications (ISCC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Symposium on Computers and Communications (ISCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC55528.2022.9912930\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC55528.2022.9912930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对工业物联网(IIoT)中虚拟机(VM)的放置和计算卸载问题,提出了一种多层边缘计算框架。与大多数现有工作不同,我们重点解决了IIoT任务流中任务之间的时间依赖性,并认为其完成时间(包括传输时间、计算时间和等待时间)有严格的要求。为了平衡系统完成时间和能耗,同时满足边缘服务器的存储容量、时间顺序任务流的完成期限和虚拟机的放置要求,我们设计了一个多对一的匹配博弈(MGVDA),共同确定最优的虚拟机放置和任务卸载决策。最后,我们证明了所得到的匹配博弈解是有效且稳定的。仿真结果验证了所提出的MGVDA算法的有效性,并显示了其相对于同类算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Joint Task Offloading and VM Placement for Edge Computing with Time-Sequential IIoT Applications
In this paper, a multi-layer edge computing frame-work for the virtual machine (VM) placement and computation offloading in industrial Internet of Things (IIoT) is proposed. Unlike most existing works, we focus on addressing the temporal dependency among tasks in an IIoT task flow, and consider that there is a stringent requirement on its completion time (including the transmission time, computation time and waiting time). For striking a balance between the system completion time and the energy consumption while satisfying the storage capacity of edge servers (ESs), completion deadline of time-sequential task flows, and placement requirements of VMs, we design a many-to-one matching game (MGVDA) to jointly determine the optimal VM placement and task offloading decisions. Finally, we prove that the resulted matching game solution is effective and stable. Simulation results examine the efficiency of the proposed MGVDA and show its superiority over the counterparts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Convergence-Time Analysis for the HTE Link Quality Estimator OCVC: An Overlapping-Enabled Cooperative Computing Protocol in Vehicular Fog Computing Non-Contact Heart Rate Signal Extraction and Identification Based on Speckle Image Active Eavesdroppers Detection System in Multi-hop Wireless Sensor Networks A Comparison of Machine and Deep Learning Models for Detection and Classification of Android Malware Traffic
×
引用
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