Computing and Network Resource Minimization Problem for Service Function Chaining against Multiple VNF Failures

A Service Function Chaining (SFC) has been an essential element in the development of Network Function Virtualization(NFV). The SFC is utilized mainly for network operators to set up a form of plural connected services with different characteristics in an appropriate order. The SFC has two critical issues which are to optimize a computing and a network resource usage and to consider simultaneous multiple VNF failures. Therefore, this paper describes a computing and network resource minimization problem for Service Function Chaining against multiple VNF failures. The problem is solved by routing the SFC on a physical network and placing a VNF on a service node. Furthermore, this paper proposes the algorithm for solving the problem and proves to be NP-complete.