Title: Cost-aware edge server placement

Authors: Qiyang Zhang; Shangguang Wang; Ao Zhou; Xiao Ma

Addresses: School of Computing, Beijing University of Posts and Telecommunications, Beijing, China ' Shenzhen Research Institute, Beijing University of Posts and Telecommunications, Beijing, China ' School of Computing, Beijing University of Posts and Telecommunications, Beijing, China ' School of Computing, Beijing University of Posts and Telecommunications, Beijing, China

Abstract: As an urgent problem to be solved, the placement of edge server is the first step in the implementation of mobile edge computing. In practice, service providers always hope to provide services to as many users as they can under the limited funds. In this paper, we aim to study the cost-aware server placement issue for a real-world scenario with access delay guarantee. Considering the network workload, we set an affordable upper limit on the maximum number of base stations. The server placement is then modelled as a mix integer nonlinear programming problem, which is proved to be NP-hard. To solve this problem with reduced computation complexity, we propose a biogeography-based optimisation algorithm. Extensive simulations on the real-world dataset from Shanghai Telecom show that the proposed algorithm outperforms other benchmarks in terms of the total placement cost and average user access delay.

Keywords: mobile edge computing; edge server placement; cost; access delay.

DOI: 10.1504/IJWGS.2022.10042204

International Journal of Web and Grid Services, 2022 Vol.18 No.1, pp.83 - 98

Received: 24 Feb 2021
Accepted: 16 Apr 2021

Published online: 25 Oct 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article