Joint bandwidth allocation and task offloading in multi-access edge computing

In recent years, multi-access edge computing (MEC) has become a hot topic. With its distributed characteristics, MEC provides more possibilities for delay-sensitive tasks. In this paper, we study a task offloading problem to shorten task delay. The problem consists of two aspects, bandwidth allocation and task offloading decision-making. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Game participants are all users. We take into account the dissatisfaction of each alliance and find the least dissatisfaction of the alliance. Then, we formulate the task offloading decision-making to minimize task delay. Task delay consists of communication delay and execution delay. Computing and storage capacity are treated as limiting conditions for decision-making. 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.