TY - GEN
T1 - Resource Allocation for Ultra-low Latency Virtual Network Services in Hierarchical 5G Network
AU - Bi, Yu
AU - Colman Meixner, Carlos
AU - Wang, Rui
AU - Meng, Fanchao
AU - Nejabati, Reza
AU - Simeonidou, Dimitra
PY - 2019/7/15
Y1 - 2019/7/15
N2 - To support ultra-low latency 5G services flexibly and use limited resources in Multi-access Edge Computing (MEC) servers efficiently, the study of latency-aware optimal hierarchical resource allocation for Service Function Chains in 5G becomes essential. In this regard, we address this resource allocation problem, for the first time, by designing a Mixed Integer Linear Programming (MILP) model based on a hierarchical 5G network interconnecting multiple MEC nodes. The objective is to minimize the total latency from five sources: processing, queueing, transmission, propagation, and optical-electronic-optical conversion. Experimental results prove that ultra-low latency requirements can be guaranteed and maximum usage of MEC node resources can be obtained. Then, a data rate-based heuristic algorithm is proposed, which can get less than 1.5 approximation ratio under different workload scenarios and achieve at least 1.7 times as much service acceptance ratio as the baseline approach.
AB - To support ultra-low latency 5G services flexibly and use limited resources in Multi-access Edge Computing (MEC) servers efficiently, the study of latency-aware optimal hierarchical resource allocation for Service Function Chains in 5G becomes essential. In this regard, we address this resource allocation problem, for the first time, by designing a Mixed Integer Linear Programming (MILP) model based on a hierarchical 5G network interconnecting multiple MEC nodes. The objective is to minimize the total latency from five sources: processing, queueing, transmission, propagation, and optical-electronic-optical conversion. Experimental results prove that ultra-low latency requirements can be guaranteed and maximum usage of MEC node resources can be obtained. Then, a data rate-based heuristic algorithm is proposed, which can get less than 1.5 approximation ratio under different workload scenarios and achieve at least 1.7 times as much service acceptance ratio as the baseline approach.
UR - http://www.scopus.com/inward/record.url?scp=85070200462&partnerID=8YFLogxK
U2 - 10.1109/ICC.2019.8761272
DO - 10.1109/ICC.2019.8761272
M3 - Conference Contribution (Conference Proceeding)
AN - SCOPUS:85070200462
T3 - IEEE International Conference on Communications
SP - 1
EP - 7
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers (IEEE)
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -