Latency-Optimal Virtual Network Functions Resource Allocation for 5G Backhaul Transport Network Slicing
2019
Wenjing Li | Yueqi Zi | Lei Feng | Fanqing Zhou | Peng Yu | Xuesong Qiu
The concept of network slicing (NS) has been proposed for flexible resource provisioning where a physical resource is partitioned into logically independent networks on demand. The NS resource allocation implies the definition of a feasible path in the infrastructure network with adequate resource availability. However, due to complex structural characteristics of the backhaul transport network, a number of issues arise when fast deploying the end-to-end (E2E) slices onto network infrastructures. In this paper, a pair-decision resource allocation model is firstly formulated to construct the mapping relationship between logical networks and substrate networks in a coordinated way. In order to improve extreme quality of service (QoS) and user experiment, latency-optimal virtual resource allocation problem is defined, subject to the backhaul capacity and bandwidth constraints. The problem is formulated as an integer linear programming (ILP) and solved with the branch-and-bound scheme, whose resolution yields an optimal virtual network function (VNF) placement and traffic routing policy. Numerical results reveal that the proposed scheme can enable the transport network latency optimization with a reduction of up to 30% and 41.6% compared to the Network Slice Design Problem (NSDP) and Random Fit Placement Algorithm (RFPA) schemes respectively. In the meanwhile, the network load balance and serviceability have been improved efficiently with better resource utilization as well.
Show more [+] Less [-]AGROVOC Keywords
Bibliographic information
This bibliographic record has been provided by Directory of Open Access Journals
