4.7 Article

Trading off Between User Coverage and Network Robustness for Edge Server Placement

Journal

IEEE TRANSACTIONS ON CLOUD COMPUTING
Volume 10, Issue 3, Pages 2178-2189

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCC.2020.3008440

Keywords

Edge server placement; network robustness; user coverage; edge cloud computing; integer programming; approximation approach

Funding

  1. Australian Research Council [DP180100212, DP200102491]
  2. Australian Research Council [DP200102491] Funding Source: Australian Research Council

Ask authors/readers for more resources

This article investigates the problem of edge server placement, aiming to deploy multiple edge servers within a specific geographic area to maximize user coverage and ensure network robustness. The authors propose an optimal approach and an approximation approach, and evaluate their performance through experiments.
Edge Cloud Computing (ECC) provides a new paradigm for app vendors to serve their users with low latency by deploying their services on edge servers attached to base stations or access points in close proximity to mobile users. From the edge infrastructure provider's perspective, a cost-effective k edge server placement (kESP) aims to place k edge servers within a particular geographic area to maximize the number of covered mobile users, i.e., to maximize the user coverage. However, in the distributed and volatile ECC environment, edge servers are subject to failures due to various reasons, e.g., software exceptions, hardware faults, cyberattacks, etc. Mobile users connected to a failed edge server have to access services in the remote cloud if they are not covered by any other edge servers. This significantly impacts mobile users quality of experience. Thus, the robustness of the edge server network (referred to as network robustness hereafter) in a specific area must be considered in edge server placement. In this article, we formally model this joint user coverage and network robustness oriented k edge server placement (kESP-CR) problem, and prove that finding the optimal solution to this problem is AM-hard. To tackle this ESP-CR, we first propose an integer programming based optimal approach (namely ESP-O) for finding optimal solutions to small-scale kESP-CR problems. Then, we propose an approximation approach, namely ESP-A, for solving large-scale kESP-CR problems efficiently and theoretically prove its approximation ratio. Finally, the performance of these two approaches are experimentally evaluated against three representative approaches on a widely-used real-world dataset.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available