Ensuring Reliability and Low Cost When Using a Parallel VNF Processing Approach to Embed Delay-Constrained Slices

Slices were introduced in 5G to enable the co-existence of applications with different requirements on a single infrastructure. Slices may be delay-constrained for mission-critical applications such as Tactile Internet applications. When delay-constrained slices are implemented as collections of virtual network function (VNF) chains, a key challenge is to place the VNFs and route the traffic through the chains to meet a strict delay constraint. Parallel VNF processing has been proposed as a promising approach. However, this approach increases the number of physical nodes in the chains, and thus decreases the reliability, which is also critical for Tactile Internet applications. Furthermore, the cost depends upon the specific VNF placement and traffic routing, as nodes and links are heterogeneous. This article tackles the issues of reliability and cost when embedding delay-constrained slices. We model the problem as an optimization problem that minimizes reliability degradation and cost while ensuring the strict delay constraint when a parallel VNF processing approach is used. Due to the complexity of the formulated problem, we also propose a Tabu search-based algorithm to find sub-optimal solutions. The results indicate that our proposed algorithm can significantly improve cost and reliability while meeting a strict delay constraint.

[1]  Jose Ordonez-Lucena,et al.  Network Slicing for 5G with SDN/NFV: Concepts, Architectures, and Challenges , 2017, IEEE Communications Magazine.

[2]  Ulas C. Kozat,et al.  Designing and embedding reliable virtual infrastructures , 2011, CCRV.

[3]  Nabil Tabbane,et al.  End-to-End Efficient Heuristic Algorithm for 5G Network Slicing , 2018, 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA).

[4]  Sunghyun Choi,et al.  Ultrareliable and Low-Latency Communication Techniques for Tactile Internet Services , 2019, Proceedings of the IEEE.

[5]  Ved P. Kafle,et al.  Reliable service function chain provisioning in software-defined networking , 2017, 2017 13th International Conference on Network and Service Management (CNSM).

[6]  Zhi-Quan Luo,et al.  Network Slicing for Service-Oriented Networks Under Resource Constraints , 2017, IEEE Journal on Selected Areas in Communications.

[7]  E. Burke,et al.  A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .

[8]  Riccardo Trivisonno,et al.  Modeling Reliability Requirements in Coordinated Node and Link Mapping , 2014, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems.

[9]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[10]  Arie M. C. A. Koster,et al.  Optimisation Models for Robust and Survivable Network Slice Design: A Comparative Analysis , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[11]  Magnos Martinello,et al.  VirtPhy: A fully programmable infrastructure for efficient NFV in small data centers , 2016, 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN).

[12]  Mahesh K. Marina,et al.  Network Slicing in 5G: Survey and Challenges , 2017, IEEE Communications Magazine.

[13]  Roch Glitho,et al.  On the Placement of VNF Managers in Large-Scale and Distributed NFV Systems , 2017, IEEE Transactions on Network and Service Management.

[14]  Raouf Boutaba,et al.  Delay-aware VNF placement and chaining based on a flexible resource allocation approach , 2017, 2017 13th International Conference on Network and Service Management (CNSM).

[15]  Pantelis A. Frangoudis,et al.  Latency and Availability Driven VNF Placement in a MEC-NFV Environment , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[16]  Ying Zhang,et al.  Stringer: Balancing Latency and Resource Usage in Service Function Chain Provisioning , 2016, IEEE Internet Computing.

[17]  Roch H. Glitho,et al.  Cost-Efficient Server Provisioning for Deadline-Constrained VNFs Chains: A Parallel VNF Processing Approach , 2019, 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[18]  Rohit Gupta,et al.  Joint Optimization of Service Function Chaining and Resource Allocation in Network Function Virtualization , 2016, IEEE Access.

[19]  Admela Jukan,et al.  VNF placement with replication for Loac balancing in NFV networks , 2016, 2017 IEEE International Conference on Communications (ICC).

[20]  Chadi Assi,et al.  A Reliability-Aware Network Service Chain Provisioning With Delay Guarantees in NFV-Enabled Enterprise Datacenter Networks , 2017, IEEE Transactions on Network and Service Management.

[21]  Vasilis Friderikos,et al.  Virtual Network Functions Routing and Placement for Edge Cloud Latency Minimization , 2018, IEEE Journal on Selected Areas in Communications.

[22]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[23]  Ioannis Lambadaris,et al.  Balancing Delay and Cost in Virtual Network Function Placement and Chaining , 2018, 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft).

[24]  Javid Taheri,et al.  A model for QoS-aware VNF placement and provisioning , 2017, 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN).

[25]  Thomas Bauschert,et al.  Combined Virtual Mobile Core Network Function Placement and Topology Optimization with Latency Bounds , 2015, 2015 Fourth European Workshop on Software Defined Networks.

[26]  Anna Brunstrom,et al.  SDN/NFV-Based Mobile Packet Core Network Architectures: A Survey , 2017, IEEE Communications Surveys & Tutorials.

[27]  Juan Felipe Botero,et al.  Resource Allocation in NFV: A Comprehensive Survey , 2016, IEEE Transactions on Network and Service Management.

[28]  Xiangming Wen,et al.  A Service-Oriented Deployment Policy of End-to-End Network Slicing Based on Complex Network Theory , 2018, IEEE Access.

[29]  Guy Pujolle,et al.  QoS-Aware VNF Placement Optimization in Edge-Central Carrier Cloud Architecture , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[30]  Lazaros Gkatzikis,et al.  The Algorithmic Aspects of Network Slicing , 2017, IEEE Communications Magazine.

[31]  Tarik Taleb,et al.  Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions , 2018, IEEE Communications Surveys & Tutorials.

[32]  Chadi Assi,et al.  Reliability-Aware Service Function Chaining With Function Decomposition and Multipath Routing , 2020, IEEE Transactions on Network and Service Management.

[33]  Peilin Hong,et al.  Virtual network forwarding graph embedding based on Tabu Search , 2017, 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP).

[34]  Anamika Dubey,et al.  Critical Load Restoration Using Distributed Energy Resources for Resilient Power Distribution System , 2019, IEEE Transactions on Power Systems.

[35]  Zhi-Quan Luo,et al.  Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency , 2020, 2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[36]  Federico Chiariotti,et al.  A Survey on Recent Advances in Transport Layer Protocols , 2018, IEEE Communications Surveys & Tutorials.

[37]  Edoardo Amaldi,et al.  On the computational complexity of the virtual network embedding problem , 2016, Electron. Notes Discret. Math..

[38]  Gang Wang,et al.  Resource Allocation for Network Slices in 5G with Network Resource Pricing , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[39]  Tao Guo,et al.  Shared Backup Network Provision for Virtual Network Embedding , 2011, 2011 IEEE International Conference on Communications (ICC).

[40]  K. K. Ramakrishnan,et al.  ClusPR: Balancing Multiple Objectives at Scale for NFV Resource Allocation , 2018, IEEE Transactions on Network and Service Management.

[41]  Roch H. Glitho,et al.  Application Component Placement in NFV-Based Hybrid Cloud/Fog Systems With Mobile Fog Nodes , 2019, IEEE Journal on Selected Areas in Communications.

[42]  Edmund K. Burke,et al.  The late acceptance Hill-Climbing heuristic , 2017, Eur. J. Oper. Res..

[43]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..