TY - GEN
T1 - Delay-Aware Flow Migration for Embedded Services in 5G Core Networks
AU - Qu, Kaige
AU - Zhuang, Weihua
AU - Ye, Qiang
AU - Shen, Xuemin Sherman
AU - Li, Xu
AU - Rao, Jaya
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - Service-oriented virtual network deployment is based on statistical resource demands of different services, while data traffic from each service fluctuates over time. In this paper, a delay-aware flow migration problem for embedded services is studied to meet end-to-end (E2E) delay requirement with time-varying traffic. A non-convex multi-objective mixed integer optimization problem is formulated, addressing the trade-off between maximum load balancing and minimum reconfiguration overhead due to flow migrations, under processing and transmission resource constraints and QoS requirement constraints. Since the original problem is non-solvable in optimization solvers due to unsupported types of quadratic constraints, it is transformed to a tractable mixed integer quadratically constrained programming (MIQCP) problem. The optimality gap between the two problems is proved to be zero, so we can obtain the optimum of the original problem through solving the MIQCP problem with some post-processing. Numerical results are presented to demonstrate the aforementioned trade-off, as well as the benefit from flow migration in terms of E2E delay performance guarantee.
AB - Service-oriented virtual network deployment is based on statistical resource demands of different services, while data traffic from each service fluctuates over time. In this paper, a delay-aware flow migration problem for embedded services is studied to meet end-to-end (E2E) delay requirement with time-varying traffic. A non-convex multi-objective mixed integer optimization problem is formulated, addressing the trade-off between maximum load balancing and minimum reconfiguration overhead due to flow migrations, under processing and transmission resource constraints and QoS requirement constraints. Since the original problem is non-solvable in optimization solvers due to unsupported types of quadratic constraints, it is transformed to a tractable mixed integer quadratically constrained programming (MIQCP) problem. The optimality gap between the two problems is proved to be zero, so we can obtain the optimum of the original problem through solving the MIQCP problem with some post-processing. Numerical results are presented to demonstrate the aforementioned trade-off, as well as the benefit from flow migration in terms of E2E delay performance guarantee.
UR - https://www.scopus.com/pages/publications/85070208624
U2 - 10.1109/ICC.2019.8761451
DO - 10.1109/ICC.2019.8761451
M3 - 会议稿件
AN - SCOPUS:85070208624
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -