Optimal Admission Control Mechanism Design for Time-Sensitive Services in Edge Computing

被引:30
作者
Chen, Shutong [1 ]
Wang, Lin [2 ,3 ]
Liu, Fangming [1 ]
机构
[1] Huazhong Univ Sci & Technol, Natl Engn Res Ctr Big Data Technol & Syst, Key Lab Serv Comp Technol & Syst, Minist Educ,Sch Comp Sci & Technol, Wuhan, Peoples R China
[2] Vrije Univ Amsterdam, Amsterdam, Netherlands
[3] Tech Univ Darmstadt, Darmstadt, Germany
来源
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) | 2022年
关键词
edge computing; admission control; mechanism design; queueing theory; ALLOCATION;
D O I
10.1109/INFOCOM48880.2022.9796847
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Edge computing is a promising solution for reducing service latency by provisioning time-sensitive services directly from the network edge. However, upon workload peaks at the resource-limited edge, an edge service has to queue service requests, incurring high waiting time. Such quality of service (QoS) degradation ruins the reputation and reduces the long-term revenue of the service provider. To address this issue, we propose an admission control mechanism for time-sensitive edge services. Specifically, we allow the service provider to offer admission advice to arriving requests regarding whether to join for service or balk to seek alternatives. Our goal is twofold: maximizing revenue of the service provider and ensuring QoS if the provided admission advice is followed. To this end, we propose a threshold structure that estimates the highest length of the request queue. Leveraging such a threshold structure, we propose O2A, a mechanism to balance the trade-off between increasing revenue from accepting more requests and guaranteeing QoS by advising requests to balk. Rigorous analysis shows that O2A achieves the goal and that the provided admission advice is optimal for end-users to follow. We further validate O2A through trace-driven simulations with both synthetic and real-world service request traces.
引用
收藏
页码:1169 / 1178
页数:10
相关论文
共 45 条
[1]  
Altman Eitan, 2013, Analytical and Stochastic Modeling Techniques and Applications. 20th International Conference, ASMTA 2013. Proceedings: LNCS 7984, P12, DOI 10.1007/978-3-642-39408-9_2
[2]  
[Anonymous], AMAZON REKOGNITION P
[3]  
[Anonymous], AMAZON TEXTRACT PRIC
[4]   Contact centers with a call-back option and real-time delay information [J].
Armony, M ;
Maglaras, C .
OPERATIONS RESEARCH, 2004, 52 (04) :527-545
[5]  
Babiarz J., 2010, IEEE COMMUN SURV TUT, V12
[6]  
Baranwal G., 2020, IEEE T CLOUD COMPUT
[7]   THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING [J].
Borgs, Christian ;
Chayes, Jennifer T. ;
Doroudi, Sherwin ;
Harchol-Balter, Mor ;
Xu, Kuang .
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2014, 28 (01) :101-119
[8]  
Chen H, 2001, IIE TRANS, V33, P847, DOI 10.1080/07408170108936878
[9]   On-Edge Multi-Task Transfer Learning: Model and Practice With Data-Driven Task Allocation [J].
Chen, Qiong ;
Zheng, Zimu ;
Hu, Chuang ;
Wang, Dan ;
Liu, Fangming .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2020, 31 (06) :1357-1371
[10]  
Chen S., OPTIMAL ADMISSION CO