TY - GEN
T1 - Robust Network Slicing in Software-Defined 5G Networks
AU - Wen, Ruihan
AU - Tang, Jianhua
AU - Quek, Tony Q.S.
AU - Feng, Gang
AU - Wang, Gang
AU - Tan, Wei
N1 - Funding Information:
This work was supported by the National Science Foundation of China under Grant number 61471089 and 61401076, the Fundamental Research Funds for the Central Universities under Grant number ZYGX2015Z005, and the Startup Funds of Chongqing University of Posts and Telecommunications under Grant number A2016-114.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Network slicing is an emerging terminology that enables operators to partition a shared substrate network into multiple logically isolated and on-demand virtual networks to support diverse communication cases. However, the performance of network slices can be heavily deteriorated due to unexpected software or hardware malfunctions in the substrate network. Furthermore, the traffic demand is usually considered as a deterministic parameter during the network slice deployment, while it could be stochastically varied in reality, and such stochasticality may invalidate some network slices. Therefore, it is imperative to develop a robust network slicing algorithm. In this paper, we first formulate the failure recovery problem of network slicing as a mixed integer programming (MIP) and then model the robust MIP (RMIP) to capture the stochastic traffic demand. We solve the RMIP by using the robust optimization approach. Numerical results reveal that the proposed the robust network slicing algorithm can provide adjustable tolerance of traffic uncertainty in comparison with the nonrobust algorithm. In the meanwhile, the trade-off between robustness of requests and the load of substrate links can be hence efficiently managed and controlled.
AB - Network slicing is an emerging terminology that enables operators to partition a shared substrate network into multiple logically isolated and on-demand virtual networks to support diverse communication cases. However, the performance of network slices can be heavily deteriorated due to unexpected software or hardware malfunctions in the substrate network. Furthermore, the traffic demand is usually considered as a deterministic parameter during the network slice deployment, while it could be stochastically varied in reality, and such stochasticality may invalidate some network slices. Therefore, it is imperative to develop a robust network slicing algorithm. In this paper, we first formulate the failure recovery problem of network slicing as a mixed integer programming (MIP) and then model the robust MIP (RMIP) to capture the stochastic traffic demand. We solve the RMIP by using the robust optimization approach. Numerical results reveal that the proposed the robust network slicing algorithm can provide adjustable tolerance of traffic uncertainty in comparison with the nonrobust algorithm. In the meanwhile, the trade-off between robustness of requests and the load of substrate links can be hence efficiently managed and controlled.
UR - http://www.scopus.com/inward/record.url?scp=85046367803&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046367803&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2017.8254685
DO - 10.1109/GLOCOM.2017.8254685
M3 - Conference contribution
AN - SCOPUS:85046367803
T3 - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
SP - 1
EP - 6
BT - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Global Communications Conference, GLOBECOM 2017
Y2 - 4 December 2017 through 8 December 2017
ER -