Load balancing edge server placement method with QoS requirements in wireless metropolitan area networks

作     者：Li, Xingcun Zeng, Feng Fang, Guanyun Huang, Yinan Tao, Xunlin 

作者机构：Cent South Univ Sch Comp Sci & Engn Changsha 410083 Peoples R China Univ Houston Dept Pharmaceut Hlth Outcomes & Policy Coll Pharm Houston TX 77204 USA Jingdezhen Ceram Inst Grad Sch Jingdezhen 333403 Peoples R China 

出 版 物：《IET COMMUNICATIONS》 (IET通信)

年 卷 期：2020年第14卷第21期

页      面：3907-3916页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 

主　　题：quality of service mobile computing greedy algorithms genetic algorithms resource allocation cloud computing metropolitan area networks QoS-aware edge server placement method wireless metropolitan area networks mobile edge computing load balancing problem edge servers greedy algorithm 

摘      要：Mobile edge computing (MEC) is concerned with moving complex tasks from data sources to nearby computing resources, which can reduce computing latency and remote cloud workload. Although there has been significant research in the field of MEC, research on edge server placement in wireless metropolitan area networks (WMANs) is overlooked, and the load balancing problem of edge servers is seldom discussed. From a practical perspective, how to place edge servers efficiently in WMANs while considering load balancing between edge servers is studied. A greedy algorithm is proposed that can balance the workload of edge servers more effectively. However, the performance of the greedy algorithm as the number of servers placed increases is not ideal. Therefore, the authors combine the greedy algorithm with a genetic algorithm (GA) to minimise the number of edge servers while ensuring load balancing between edge servers and quality of service (QoS) requirements for mobile users. Finally, they conduct simulation experiments and compare the proposed algorithms with other algorithms. The improved GA proposed is superior to the greedy algorithm in terms of load balancing and the number of servers. The experimental results demonstrate that the algorithm has excellent performance.