Priority Based Service Placement Strategy in Heterogeneous Mobile Edge Computing.

Mobile Edge Computing (MEC) is a promising method to reduce service delay by computational ability at the edge nodes. However, the limited resources at the edge nodes make it hard to response various services simultaneously. Hence, it is challenging to utilize the limited edge resources to host various service and reduce service response time. In this paper, we investigate the service placement problem such that the average service response time is minimized, which affects the user experience significantly. We define the priorities for nodes and services according to their contribution values, which indicates the influence for reducing service response time. Then, we propose a priority placement (2P) algorithm by taking both priority properties and local optimization into account. We conduct extensive simulations and the experimental results show that the 2P algorithm can reduce the average service response time by 23%–46%, which indicates the 2P algorithm has better performance in reducing response time compared to the classical methods.