arrow
Return

Server Placement for Edge Computing: A Robust Submodular Maximization Approach

delete2023-06-01
delete10
PRE
AI
Y
Yuben Qu
L
Lihao Wang
H
Haipeng Dai *
W
Weijun Wang
董超 cover
董超 (Chao Dong)
吴帆 cover
吴帆 (Fan Wu)
Song Guo cover
Song Guo (Song Guo)
DOI:10.1109/TMC.2021.3136868delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this work, we study the problem of Robust Server Placement (RSP) for edge computing, i.e., in the presence of uncertain edge server failures, how to determine a server placement strategy to maximize the expected overall workload that can be served by edge servers. We mathematically formulate the RSP problem in the form of robust max-min optimization, derived from two consequentially equivalent transformations of the problem that does not consider robustness and followed by a robust conversion. RSP is challenging to solve, because the explicit expression of the objective function in RSP is hard to obtain, and it is a robust max-min problem with knapsack constraints, which is still an unexplored problem in the literature. We reveal that the objective function is monotone submodular, and propose two solutions to RSP. First, after proving that the involved constraints form a $p$p-independence system constraint, where $p$p is a parameter determined by the coefficients in the knapsack constraints, we propose an algorithm that achieves a provable approximation ratio in polynomial time. Second, we prove that one of the knapsack constraints is a matroid contraint, and propose another polynomial time algorithm with a better approximation ratio. Furthermore, we discuss the applicability of the aforementioned algorithms to the case with an additional server number constraint. Both synthetic and trace-driven simulation results show that, given any maximum number of server failures, our proposed algorithms outperform four state-of-the-art algorithms and approaches the optimal solution, which applies exhaustive exponential searches, while the proposed latter algorithm brings extra performance gains compared with the former one.
Keywords:
Servers
Approximation algorithms
Optimization
Delays
Costs
Mobile computing
Robustness
Edge computing networks
server placement
robust submodular optimization

Journal

IEEE Transactions on Mobile Computing cover
IEEE Transactions on Mobile Computing
IF:
9.2
Papers:
5.9K
Citations:
1.8W

Organization

H
hong kong polytechnic university
Scholars:
3.0W
Papers: 4.1W
Citations: 921
S
shanghai jiao tong university
Scholars:
15.7W
Papers: 11.7W
Citations: 159
N
nanjing university
Scholars:
7.8W
Papers: 5.6W
Citations: 87
researcher View more organizations
Cited Papers

Cited Papers

Cloudlet Placement and Task Allocation in Mobile Edge Computing
err2019-06-01
err108
errOAAI
errYang, Song; Li, Fan; Shen, Meng; Chen, Xu; Fu, Xiaoming; Wang, Yu
errShare
errSave
Optimizing Task Assignment for Reliable Blockchain-Empowered Federated Edge Learning
err2021-02-01
err53
PREAI
errKang, Jiawen; Xiong, Zehui; Li, Xuandi; Zhang, Yang; Niyato, Dusit; Leung, Cyril; Miao, Chunyan
errShare
errSave
A Survey of Opportunistic Offloading
err2018-01-01
err102
PREAI
errXu, Dianlei; Li, Yong; Chen, Xinlei; Li, Jianbo; Hui, Pan; Chen, Sheng; Crowcroft, Jon
errShare
errSave
Phthalocyanines of a Novel Structure: Dinaphthotetraazaporphyrins with D2h Symmetry
err2002-05-01
err0
PREAI
errNagao Kobayashi; Tohru Ashida; Tetsuo Osa; Hideo Konami
errShare
errSave
Novel metronomic chemotherapy and cancer vaccine combinatorial strategy for hepatocellular carcinoma in a mouse model
err2015-05-06
err0
errOAAI
errMaria Tagliamonte; Annacarmen Petrizzo; Maria Napolitano; Antonio Luciano; Claudio Arra; Piera Maiolino; Francesco Izzo; Maria Lina Tornesello; Luigi Aurisicchio; Gennaro Ciliberto; Franco M. Buonaguro; Luigi Buonaguro
errShare
errSave
Magnetic monopoles and the survival of galactic magnetic fields
err1982-09-15
err0
PREAI
errMichael S. Turner; E. N. Parker; T. J. Bogdan
errShare
errSave
researcher View more