QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks
<|reference_start|>QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks: In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of service (QoS) requirements. We propose a mixed-integer nonlinear programming (MINLP) formulation for the considered NS problem that can flexibly route the traffic flow of the services on multiple paths and provide end-to-end delay and reliability guarantees for all services. To overcome the computational difficulty due to the intrinsic nonlinearity in the MINLP formulation, we transform the MINLP formulation into an equivalent mixed-integer linear programming (MILP) formulation and further show that their continuous relaxations are equivalent. In sharp contrast to the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial-time solvable linear programming problem, which significantly facilitates the algorithmic design. Based on the newly proposed MILP formulation, we develop a customized column generation (cCG) algorithm for solving the NS problem. The proposed cCG algorithm is a decomposition-based algorithm and is particularly suitable for solving large-scale NS problems. Numerical results demonstrate the efficacy of the proposed formulations and the proposed cCG algorithm.<|reference_end|>
@article{chen2024qos-aware,
    title={QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented
  Networks},
    author={Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai, and Zhi-Quan Luo},
    journal={arXiv preprint arXiv:2409.13943},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.13943},
    primaryClass={cs.IT eess.SP math.IT math.OC}
}