Modeling and analysis of robust service composition for network functions virtualization

Abstract Fault tolerance is critical for constructing a reliable service in Network Functions Virtualization (NFV). In this paper, we propose novel models and algorithms that provide the resilience of NFV services from multiple node and link failures. We first design an optimization model and the PAR protection algorithm that can efficiently protect an NFV service demand from network failures without any action from a controller due to the diversity of flow assignment. We then develop an optimization model for total demand protection with a guarantee of recovering the whole demand volume. Further, a new restoration algorithm, namely UNIT, is proposed for the design of large survivable NFV-based networks with the recovery of the affected bandwidth under the uncertainty of multiple network failures. We analytically prove the performance guarantee of UNIT in comparison with the optimal static solution. The results of our experimental study in a Mininet-based environment with the Ryu controller show that a combination of PAR and UNIT efficiently protects NFV-based networks from failures in terms of both resource restoration and recovery time.

[1]  Michael Seufert,et al.  Performance Evaluation of Service Functions Chain Placement Algorithms in Edge Cloud , 2018, 2018 30th International Teletraffic Congress (ITC 30).

[2]  Jianping Wang,et al.  Efficient Orchestration Mechanisms for Congestion Mitigation in NFV: Models and Algorithms , 2017, IEEE Transactions on Services Computing.

[3]  Mostafa Ammar,et al.  An Approach for Service Function Chain Routing and Virtual Function Network Instance Migration in Network Function Virtualization Architectures , 2017, IEEE/ACM Transactions on Networking.

[4]  Hoai-Nam Chu,et al.  Multi-Provider and Multi-Domain Resource Orchestration in Network Functions Virtualization , 2019, IEEE Access.

[5]  Serge Fdida,et al.  DTN support for news dissemination in an urban area , 2012, Comput. Networks.

[6]  Gang Feng,et al.  On Robustness of Network Slicing for Next-Generation Mobile Networks , 2019, IEEE Transactions on Communications.

[7]  Fabio D'Andreagiovanni,et al.  A fast robust optimization-based heuristic for the deployment of green virtual network functions , 2017, J. Netw. Comput. Appl..

[8]  Andreas Kassler,et al.  A Power Efficient and Robust Virtual Network Functions Placement Problem , 2016, 2016 28th International Teletraffic Congress (ITC 28).

[9]  Srinivasan Ramasubramanian,et al.  Independent Directed Acyclic Graphs for Resilient Multipath Routing , 2012, IEEE/ACM Transactions on Networking.

[10]  David Watson,et al.  An Experimental Study of Internet Path Diversity , 2006, IEEE Transactions on Dependable and Secure Computing.

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Filip De Turck,et al.  Network Function Virtualization: State-of-the-Art and Research Challenges , 2015, IEEE Communications Surveys & Tutorials.

[13]  Xin Gao,et al.  Service Chain Composition with Failures in NFV Systems: A Game-Theoretic Perspective , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[14]  George Pavlou,et al.  A toolchain for simplifying network simulation setup , 2013, SimuTools.

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  Francesco Musumeci,et al.  Protection strategies for virtual network functions placement and service chains provisioning , 2017, Networks.

[17]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[18]  Yin Zhang,et al.  R3: resilient routing reconfiguration , 2010, SIGCOMM '10.

[19]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[20]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[21]  Ren-Hung Hwang,et al.  Toward Optimal Resource Allocation of Virtualized Network Functions for Hierarchical Datacenters , 2018, IEEE Transactions on Network and Service Management.