MAESP: Mobility aware edge service placement in mobile edge networks

被引:16
作者
Zhao, Xuhui [1 ,2 ]
Shi, Yan [1 ]
Chen, Shanzhi [3 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
[2] Henan Univ Sci & Technol, Luoyang, Peoples R China
[3] China Acad Telecommun Technol, State Key Lab Wireless Mobile Commun, Beijing, Peoples R China
基金
美国国家科学基金会;
关键词
Mobile edge networks; User mobility; Service placement; Multi-objective context multi-armed bandit; POLICY;
D O I
10.1016/j.comnet.2020.107435
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile edge networks can provide ultra-low latency by deploying services at the edge of networks. However, it is impracticable to place services on all the edge servers due to limited deployment cost requirement. It is desirable to make the optimal edge application placement decisions in a minimum response time and deployment cost, which involve two possibly conflicting objectives. An important issue here is that the number of edge application request from mobile users, which is the key factor determining the realization of two objectives, can vary considerably and the number of edge application request usually unknown before deploying edge application in a particular edge site. It has been found recently that human mobility (location and time features) have a strong influence on what kinds of application that mobile users choose to use. Based on the above observation, we investigate the mobility aware edge service placement problem aiming at optimizing service latency and deployment cost. The problem is formulated as a multi-objective optimization problem and can be solved by multi-objective context multi-armed bandit with a dominant objective. The features of user mobility (time, location) are considered as the context information guiding the edge application placement decisions. We develop mobility-aware edge service placement (MAESP) method and analyse performance measures of MAESP using the 2-dimensional (2D) regret. We show that the 2D regret of MAESP are sublinear in the number of rounds. Based on a real-world dataset, we carry out extensive simulations to evaluate the performance of MAESP. The results show that MAESP outperforms the benchmark algorithms.
引用
收藏
页数:13
相关论文
共 44 条
  • [1] [Anonymous], 2016, IEEE ICC, DOI DOI 10.1109/ICC.2016.7510952
  • [2] Ashraf M. I., 2016, IEEE GLOBE WORK, P1
  • [3] A multi-source dataset of urban life in the city of Milan and the Province of Trentino
    Barlacchi, Gianni
    De Nadai, Marco
    Larcher, Roberto
    Casella, Antonio
    Chitic, Cristiana
    Torrisi, Giovanni
    Antonelli, Fabrizio
    Vespignani, Alessandro
    Pentland, Alex
    Lepri, Bruno
    [J]. SCIENTIFIC DATA, 2015, 2
  • [4] Mobile Edge Computing Resources Optimization: A Geo-Clustering Approach
    Bouet, Mathieu
    Conan, Vania
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (02): : 787 - 796
  • [5] Calkins H, 2017, J ARRYTHM, V33, P369, DOI 10.1016/j.joa.2017.08.001
  • [6] Mobile Edge Cloud Network Design Optimization
    Ceselli, Alberto
    Premoli, Marco
    Secci, Stefano
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) : 1818 - 1831
  • [7] Adaptive Replication for Mobile Edge Computing
    Chang, Wan-Chi
    Wang, Pi-Chung
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (11) : 2422 - 2432
  • [8] Chen L., 2018, Advances in Neural Information Processing Systems, P3247
  • [9] Spatio-Temporal Edge Service Placement: A Bandit Learning Approach
    Chen, Lixing
    Xu, Jie
    Ren, Shaolei
    Zhou, Pan
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) : 8388 - 8401
  • [10] Chen W., 2013, P 30 INT C MACH LEAR