TY - GEN
T1 - Robust resource provisioning in time-varying edge networks
AU - Yu, Ruozhou
AU - Xue, Guoliang
AU - Wan, Yinxin
AU - Tang, Jian
AU - Yang, Dejun
AU - Ji, Yusheng
N1 - Publisher Copyright:
© 2020 ACM.
PY - 2020/10/11
Y1 - 2020/10/11
N2 - Edge computing is one of the revolutionary technologies that enable high-performance and low-latency modern applications, such as smart cities, connected vehicles, etc. Yet its adoption has been limited by factors including high cost of edge resources, heterogeneous and fluctuating demands, and lack of reliability. In this paper, we study resource provisioning in edge computing, taking into account these different factors. First, based on observations from real demand traces, we propose a time-varying stochastic model to capture the time-dependent and uncertain demand and network dynamics in an edge network. We then apply a novel robustness model that accounts for both expected and worst-case performance of a service. Based on these models, we formulate edge provisioning as a multi-stage stochastic optimization problem. The problem is NP-hard even in the deterministic case. Leveraging the multi-stage structure, we apply nested Benders decomposition to solve the problem. We also describe several efficiency enhancement techniques, including a novel technique for quickly solving the large number of decomposed subproblems. Finally, we present results from real dataset-based simulations, which demonstrate the advantages of the proposed models, algorithm and techniques.
AB - Edge computing is one of the revolutionary technologies that enable high-performance and low-latency modern applications, such as smart cities, connected vehicles, etc. Yet its adoption has been limited by factors including high cost of edge resources, heterogeneous and fluctuating demands, and lack of reliability. In this paper, we study resource provisioning in edge computing, taking into account these different factors. First, based on observations from real demand traces, we propose a time-varying stochastic model to capture the time-dependent and uncertain demand and network dynamics in an edge network. We then apply a novel robustness model that accounts for both expected and worst-case performance of a service. Based on these models, we formulate edge provisioning as a multi-stage stochastic optimization problem. The problem is NP-hard even in the deterministic case. Leveraging the multi-stage structure, we apply nested Benders decomposition to solve the problem. We also describe several efficiency enhancement techniques, including a novel technique for quickly solving the large number of decomposed subproblems. Finally, we present results from real dataset-based simulations, which demonstrate the advantages of the proposed models, algorithm and techniques.
KW - edge computing
KW - multi-stage stochastic optimization
KW - resource allocation
KW - robustness
KW - time-varying
UR - http://www.scopus.com/inward/record.url?scp=85093956285&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85093956285&partnerID=8YFLogxK
U2 - 10.1145/3397166.3409146
DO - 10.1145/3397166.3409146
M3 - Conference contribution
AN - SCOPUS:85093956285
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 21
EP - 30
BT - MobiHoc 2020 - Proceedings of the 2020 International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
PB - Association for Computing Machinery
T2 - 21st ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2020
Y2 - 11 October 2020 through 14 October 2020
ER -