Stateful Serverless Application Placement in MEC With Function and State Dependencies
IEEE Transactions on Computers · 01.09.2023 · 72 (9) · 2701-2716
DOI: 10.1109/tc.2023.3262947 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Computers, erschienen am 01.09.2023. Verfasst von Zichuan Xu und 7 weiteren Autor:innen. Die Arbeit wurde bisher 58-mal zitiert (Crossref) und nennt 45 Literaturangaben. Gefördert von: National Natural Science Foundation of China, City University of Hong Kong.
Abstract (Originalsprache)
Serverless computing is emerging as an enabling technology for elastic and low-cost AI applications in the edge of core networks. It allows AI developers to decompose a complex training and time-sensitive inference task into multiple functions with dependency, and upload the task to a Multi-access Edge Computing platform (MEC) for execution. Serverless computing adopts a popular design principle: the disaggregation of storage and computation, making the functions ‘stateless’. However, most AI applications are ‘stateful’ and rely on an external storage service to manage their states (ephemeral data). This will incur a prohibitively long delay for delay-sensitive AI applications if external services storing the states are far from the serverless functions. Motivated by this critical issue, in this paper we investigate a fundamental problem in serverless computing – the stateful serverless application placement problem, for which, we first propose an efficient heuristic algorithm, and then devise an approximation algorithm with a provable approximation ratio for one of its special cases. We also consider the online version of the problem, and develop an online learning-driven algorithm with a bounded regret. The crux of the online algorithm is the adoption of the multi-armed bandits technique for dynamic admissions of inference requests, under the uncertainty of both data volumes of requests and network delays. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results show that the proposed algorithms outperform their counterparts, reducing at least 32% in the total cost and 27% of the average delay.
Förderung
- National Natural Science Foundation of China
- City University of Hong Kong
Zitieren
APA
Xu, Z., Zhou, L., Liang, W., Xia, Q., Xu, W., Ren, W., Ren, H., & Zhou, P. (2023). Stateful Serverless Application Placement in MEC With Function and State Dependencies. IEEE Transactions on Computers, 72(9), 2701-2716. https://doi.org/10.1109/tc.2023.3262947
Vancouver
Xu Z, Zhou L, Liang W, Xia Q, Xu W, Ren W, et al. Stateful Serverless Application Placement in MEC With Function and State Dependencies. IEEE Transactions on Computers. 2023;72(9):2701-2716. doi:10.1109/tc.2023.3262947
BibTeX
@article{Xu2023,
author = {Xu, Zichuan and Zhou, Lizhen and Liang, Weifa and Xia, Qiufen and Xu, Wenzheng and Ren, Wenhao and Ren, Haozhe and Zhou, Pan},
title = {Stateful Serverless Application Placement in MEC With Function and State Dependencies},
journal = {IEEE Transactions on Computers},
year = {2023},
volume = {72},
number = {9},
pages = {2701--2716},
doi = {10.1109/tc.2023.3262947}
}
EUVIMED