.png){kind=icon}
返回
Efficient Algorithms for Multi-Component Application Placement in Mobile Edge Computing
.png){kind=icon}
OA
AI
DOI：10.1109/TCC.2020.3038626.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we address the Multi-Component Application Placement Problem (${\sf MCAPP}$MCAPP) in Mobile Edge Computing (MEC) systems. We formulate this problem as a Mixed Integer Non-Linear Program (MINLP) with the objective of minimizing the total cost of running the applications. In our formulation, we take into account two important and challenging characteristics of MEC systems, the mobility of users and the network capabilities. We analyze the complexity of ${\sf MCAPP}$MCAPP and prove that it is $NP$NP-hard, that is, finding the optimal solution in reasonable amount of time is infeasible. We design two algorithms, one based on matching and local search and one based on a greedy approach, and evaluate their performance by conducting an extensive experimental analysis driven by two types of user mobility models, real-life mobility traces and random-walk. The results show that the proposed algorithms obtain near-optimal solutions and require small execution times for reasonably large problem instances.
Keyword:
Mobile edge computing
application placement
heuristic algorithm
期刊
I
IF:
5
论文数:
1.8K
被引数:
4.3K
机构
引用论文
.png){kind=icon}
分享收藏Dynamical Resource Allocation in Edge for Trustable Internet-of-Things Systems: A Reinforcement Learning Method可信物联网系统Edge中的动态资源分配: 一种强化学习方法
PREAI
分享收藏
查看更多内容