多址边缘计算中结合带宽分配的延迟敏感任务卸载

Shudian Song, Shuyue Ma, X. Zhu, Yumei Li, Feng Yang, Linbo Zhai
{"title":"多址边缘计算中结合带宽分配的延迟敏感任务卸载","authors":"Shudian Song, Shuyue Ma, X. Zhu, Yumei Li, Feng Yang, Linbo Zhai","doi":"10.1109/LCN53696.2022.9843342","DOIUrl":null,"url":null,"abstract":"In recent years, multi-access edge computing (MEC) has become a hot topic. In this paper, we study a task offloading problem combined with bandwidth allocation in multi-access edge computing. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Then, we formulate the task offloading decision-making to minimize the delay. The delay consists of communication delay and execution delay. To solve the offloading problem, we convert the dissatisfaction of alliance into a vector, and obtain the Pareto optimal through multi-objective particle swarm algorithm. Then, we use Branch and Bound method to construct the propagation tree to facilitate decision-making. To evaluate the edge servers in the tree, we build an evaluation matrix and transform the matrix to a set of evaluation index which is used on task offloading decision-making. A large number of experimental results show that our algorithm is better than compared algorithm.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delay-sensitive Task offloading combined with Bandwidth Allocation in Multi-access Edge Computing\",\"authors\":\"Shudian Song, Shuyue Ma, X. Zhu, Yumei Li, Feng Yang, Linbo Zhai\",\"doi\":\"10.1109/LCN53696.2022.9843342\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, multi-access edge computing (MEC) has become a hot topic. In this paper, we study a task offloading problem combined with bandwidth allocation in multi-access edge computing. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Then, we formulate the task offloading decision-making to minimize the delay. The delay consists of communication delay and execution delay. To solve the offloading problem, we convert the dissatisfaction of alliance into a vector, and obtain the Pareto optimal through multi-objective particle swarm algorithm. Then, we use Branch and Bound method to construct the propagation tree to facilitate decision-making. To evaluate the edge servers in the tree, we build an evaluation matrix and transform the matrix to a set of evaluation index which is used on task offloading decision-making. A large number of experimental results show that our algorithm is better than compared algorithm.\",\"PeriodicalId\":303965,\"journal\":{\"name\":\"2022 IEEE 47th Conference on Local Computer Networks (LCN)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 47th Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN53696.2022.9843342\",\"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 47th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN53696.2022.9843342","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,多接入边缘计算(MEC)已成为一个热门话题。本文研究了多址边缘计算中与带宽分配相结合的任务卸载问题。基于联盟博弈,制定带宽分配方案,使联盟的不满最小化。然后,我们制定了任务卸载决策,以最小化延迟。延迟包括通信延迟和执行延迟。为了解决卸载问题,我们将联盟的不满意程度转化为一个向量,并通过多目标粒子群算法得到Pareto最优解。然后,利用分支定界法构造传播树,便于决策。为了对树中的边缘服务器进行评价,我们建立了评价矩阵,并将矩阵转化为一组评价指标,用于任务卸载决策。大量的实验结果表明,我们的算法优于比较算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay-sensitive Task offloading combined with Bandwidth Allocation in Multi-access Edge Computing
In recent years, multi-access edge computing (MEC) has become a hot topic. In this paper, we study a task offloading problem combined with bandwidth allocation in multi-access edge computing. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Then, we formulate the task offloading decision-making to minimize the delay. The delay consists of communication delay and execution delay. To solve the offloading problem, we convert the dissatisfaction of alliance into a vector, and obtain the Pareto optimal through multi-objective particle swarm algorithm. Then, we use Branch and Bound method to construct the propagation tree to facilitate decision-making. To evaluate the edge servers in the tree, we build an evaluation matrix and transform the matrix to a set of evaluation index which is used on task offloading decision-making. A large number of experimental results show that our algorithm is better than compared algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信