Joint Optimization of Coverage and Reliability for Application Placement in Mobile Edge Computing
Feifei Chen, Jingwen Zhou, Xiaoyu Xia, Yong Xiang, Xuehong Tao, Qiang He
Abstract
Mobile edge computing (MEC) provides a new distributed computing paradigm that overcomes the inability of cloud computing to offer low end-to-end latency. In a MEC environment, app vendors can deliver lower-latency services to mobile app users by placing applications on edge servers in close proximity to app users. From an app vendor's perspective, an optimal edge application placement strategy under a budget ( <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> ) constraint aims to place application instances on <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> edge servers within a specific area to maximize user coverage. However, edge servers may be subject to failure due to multiple reasons, e.g., hardware faults, software exceptions, cyber-attacks, etc. App users served by failed edge servers need to access applications from remote cloud servers if they cannot access any other edge servers. This impacts app users’ quality of experience significantly. Thus, app vendors need to consider the reliability of the edge server network when choosing edge servers for placing their application instances. We make the first attempt in this paper to tackle this problem of joint optimization of coverage and reliability for edge application placement (EAP-CR). We formulate this problem as a constrained optimization problem and prove its <inline-formula><tex-math notation="LaTeX">$\mathcal {NP}$</tex-math></inline-formula> -hardness theoretically. Then, we propose an optimal approach to find the optimal solutions with the integer programming technique, an approximation approach is also proposed to find approximate solutions for large-scale EAP-CR problems. We evaluate EAP- <inline-formula><tex-math notation="LaTeX">$OPT$</tex-math></inline-formula> and EAP- <inline-formula><tex-math notation="LaTeX">$APX$</tex-math></inline-formula> against three relevant approaches through experiments conducted on a widely-used real-world data set and a synthetic data set. The results demonstrate that our proposed approaches can solve the EAP-CR problem effectively and efficiently.