Reliability Aware Service Function Chaining With Function Decomposition and Multipath Routing
Network Function Virtualization (NFV) converts network functions executed by costly middleboxes into instances of Virtual Network Functions (VNFs) hosted by industry standard Physical Machines (PMs) This has proven to be quite an efficient approach when it comes to enabling automated network operations and the elastic provisioning of resources to support heterogeneous services. Today's revolutionary services impose a remarkably elevated reliability together with ultra low latency requirements. Therefore, in addition to having highly reliable VNFs, these VNFs have to be optimally placed in such a way to rapidly route traffic among them with the least utilization of bandwidth. Hence, the proper selection of PMs to meet the above mentioned reliability and delay requirements becomes a remarkably challenging problem. None of the existing publications addressing such a problem concurrently adopts VNF decomposition to enhance the flexibility of the VNFs' placement and a hybrid routing scheme to achieve an optimal trade off between the above mentioned objectives. In this paper, a VNF decomposition based backup strategy is proposed together with a delay aware hybrid multipath routing scheme for enhancing the reliability of NFV enabled network services while jointly reducing delays these services experience. The problem is formulated as a Mixed Integer Linear Program (MILP) whose resolution yields an optimal VNF placement and traffic routing policy. Next, the delay aware hybrid shortest path based heuristic algorithm is proposed to work around the MILP's complexity. Thorough numerical analysis and simulations are conducted to validate the proposed algorithm and evaluate its performance. Results show that the proposed algorithm outperforms its existing counterparts by 7.53% in terms of computing resource consumption.
IEEE Transactions on Network and Service Management