{"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}
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.