http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Transport Theoretic Approach for Computational Task Migration in Multi-Access Edge Computing
Sarder Fakhrul Abedin(사르더 파쿠룰 아베딘),Md. Shirajum Munir(엠디 시라줌 무니르),SeokWon Kang(강석원),Choong Seon Hong(홍충선) Korean Institute of Information Scientists and Eng 2019 정보과학회논문지 Vol.46 No.10
In the present work, the problem of computational task migration in the Multi-Access Edge Computing (MEC) Network has been addressed and the goal is to minimize the computational cost including the task migration cost of the MEC network. Apparently, at first, we have formulated 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 have solved the transportation problem using the Vogel’s Approximation Algorithm (VAM), where the optimal task migration was achieved. Finally, in the simulation, we have demonstrated that the proposed approach significantly outperforms the baseline approach in terms of the task migration cost, average response time, and average queuing delay in the MEC network.