¿µ¹®³»¿ë (English Abstract) |
In this paper, the problem of computational task migration in the Multi-Access Edge Computing (MEC) Network is addressed in which the goal is to minimize the computational cost including the task migration cost of the MEC network. Therefore, first, we formulate a Hitchcock-Koopmans transportation problem which corresponds to the task migration from the over-utilized MEC servers to the under-utilized MEC server. Second, we solve the transportation problem using the Vogel¡¯s Approximation Algorithm (VAM) where the optimal task migration is achieved. Finally, in the simulation, we show that the proposed approach significantly outperforms the baseline approach in terms of the task migration cost. |