KSC 2018
Current Result Document : 9 / 9
| 한글제목(Korean Title) |
A Transport Theoretic Approach for Computational Task Migration in Multi-Access Edge Computing |
| 영문제목(English Title) |
A Transport Theoretic Approach for Computational Task Migration in Multi-Access Edge Computing |
| 저자(Author) |
Sarder Fakhrul Abedin
Anupam Kumar Bairagi
Md. Shirajum Munir
Choong Seon Hong
|
| 원문수록처(Citation) |
VOL 45 NO. 02 PP. 0328 ~ 0330 (2018. 12) |
한글내용
(Korean Abstract) |
|
영문내용
(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. |
| 키워드(Keyword) |
|
| 파일첨부 |
PDF 다운로드
|
