Robust Network Slicing in Software-Defined 5G Networks
Robust Network Slicing in Software-Defined 5G Networks
复制标题
DOI：
10.1109/glocom.2017.8254685
复制
发表时间：
2017-12
期刊：
影响因子：
--
通讯作者：
Ruihan Wen;Jianhua Tang;Tony Q. S. Quek;G. Feng;G. Wang;W. Tan
中科院分区：
文献类型：
--
作者：
Ruihan Wen;Jianhua Tang;Tony Q. S. Quek;G. Feng;G. Wang;W. Tan
网络切片是一个新兴术语，使运营商能够将共享底层网络划分为多个逻辑上隔离的按需虚拟网络，以支持不同的通信案例。然而，由于底层网络中意外的软件或硬件故障，网络切片的性能可能会严重恶化。此外，在网络切片部署过程中，流量需求通常被视为确定性参数，而现实中流量需求可能会随机变化，这种随机性可能会导致某些网络切片失效。因此，开发鲁棒的网络切片算法势在必行。在本文中，我们首先将网络切片的故障恢复问题表述为混合整数规划（MIP），然后对鲁棒MIP（RMIP）进行建模以捕获随机流量需求。我们通过使用鲁棒优化方法来求解 RMIP。数值结果表明，与非鲁棒算法相比，所提出的鲁棒网络切片算法可以提供对流量不确定性的可调容限。同时，可以有效地管理和控制请求的鲁棒性和基底链路的负载之间的权衡。
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.