期刊
IEEE INTERNET OF THINGS JOURNAL
卷 9, 期 2, 页码 1575-1590出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2021.3093155
关键词
Servers; Delays; Task analysis; Optimization; Cloud computing; Urban areas; Internet of Things; Cost; delay; hand-off; mobile-edge computing; multiobjective optimization; server placement
资金
- Hundred Young Talents Plan Project of Guangdong University of Technology [263113618]
- National Natural Science Foundation of China [61702127]
- Science and Technology Program of Guangzhou [201804010461]
- China Scholarship Council [201908440085, 201908440064]
- Guangdong Basic and Applied Basic Research Foundation [2019A1515011114]
- Natural Sciences and Engineering Research Council of Canada
- Canada Foundation for Innovation
- British Columbia Knowledge Development Fund
This article studies the problem of deploying edge servers in a metropolitan area. By analyzing the Shanghai Taxi Trace and building multiobjective optimization models, a heuristic multiobjective optimization method is proposed to address this problem. Numerical results demonstrate that this method achieves a desirable balance among delay, hand-offs, and cost.
Edge computing pushes computation and storage resources to the network edge, which is close to end users, and thus, is critical for latency-sensitive applications, e.g., intelligent vehicular ad hoc networks (VANETs). To enable these services, a set of edge servers needs to be deployed to the roadsides. Such deployment should offer low-latency services to end users, while keeping a low deployment or maintenance cost, which is a nontrivial task. In this article, we study the edge server placement problem in a metropolitan area. This problem is composed of two parts to determine: 1) the locations of the servers and 2) the coverage of each server, with multiple optimization objectives. First, we study the Shanghai Taxi Trace to gain insights into the traffic pattern of taxis, especially how vehicles move between different locations. Second, we build multiobjective optimization models to characterize the tradeoff among three critical performance metrics, namely, the initial deployment cost, the runtime cost (i.e., number of hand-offs between different servers), and the average delay of tasks. Due to the intractability of these NP-hard problems, we propose a heuristic multiobjective optimization method to decompose the global problem into a set of local problems with tractable scale. Numerical results verify that our heuristic strategy achieves a desirable balance among the three performance metrics, e.g., a 5% compromise of the delay can reduce up to 50% of the hand-offs for small local areas, and 10%+ for the entire global area, compared with the best existing algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据