A Scalable and Offloading-Based Traffic Classification Solution in NFV/SDN Network Architectures

Service Function Chaining (SFC) is an enabling technology to provide end-to-end service differentiation according to specific user requirements. Although emerging technologies such as Software-Defined Networking (SDN) and Network Function Virtualization (NFV) are perfect enablers for SFC, hardware limitation of Ternary-Content Addressable Memories (TCAMs) can be an obstacle when handling a large variability of SFC requests, derived from the increasing number of users, and the heterogeneity of applications and Quality of Service (QoS) requirements. This article introduces and investigates the problem of TCAM size limitation on the classification procedure of SFC requests in SDN-based SFC environments. To overcome this limitation, the classification of incoming SFC requests is proposed to be offloaded to transient nodes when the occupation of the ingress node flow table is close to its maximum. An Integer Linear Programming (ILP) formulation is provided to formalize the Chain Request Classification Offloading (CRCO) problem, that consists in maximizing the number of SFC requests that can be served. Furthermore, a heuristic algorithm is presented to solve the CRCO problem in feasible time. The performance evaluation carried out over two real topologies, shows that the proposed offloading strategy can greatly increase the number of accepted requests without significantly affecting the network QoS.

[1]  Yu Zhou,et al.  Multi-step-ahead host load prediction using autoencoder and echo state networks in cloud computing , 2015, The Journal of Supercomputing.

[2]  Bo Yi,et al.  A comprehensive survey of Network Function Virtualization , 2018, Comput. Networks.

[3]  Anat Bremler-Barr,et al.  Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications , 2018, IEEE/ACM Transactions on Networking.

[4]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[5]  Tarik Taleb,et al.  Traffic Steering for Service Function Chaining , 2019, IEEE Communications Surveys & Tutorials.

[6]  Thierry Turletti,et al.  Rules Placement Problem in OpenFlow Networks: A Survey , 2016, IEEE Communications Surveys & Tutorials.

[7]  Jin Zhao,et al.  A Tale of Two (Flow) Tables: Demystifying Rule Caching in OpenFlow Switches , 2019, ICPP.

[8]  Paolo Baldan,et al.  Approximating the Behaviour of Graph Transformation Systems , 2002, ICGT.

[9]  Hu Aiqun,et al.  FloodDefender: Protecting data and control plane resources under SDN-aimed DoS attacks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[10]  Eric Torng,et al.  A Ternary Unification Framework for optimizing TCAM-based packet classification systems , 2013, Architectures for Networking and Communications Systems.

[11]  Jaime Llorca,et al.  Approximation algorithms for the NFV service distribution problem , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[12]  Carlos Pignataro,et al.  Network Service Header (NSH) , 2018, RFC.

[13]  Vincenzo Eramo,et al.  Server Resource Dimensioning and Routing of Service Function Chain in NFV Network Architectures , 2016, J. Electr. Comput. Eng..

[14]  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.

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

[16]  Jia Wang,et al.  Scalable flow-based networking with DIFANE , 2010, SIGCOMM '10.

[17]  Marco Canini,et al.  Methodology, measurement and analysis of flow table update characteristics in hardware openflow switches , 2018, Comput. Networks.

[18]  Dimitrios P. Pezaros,et al.  Arbitrary packet matching in OpenFlow , 2015, 2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR).

[19]  Vincenzo Eramo,et al.  Optimizing the Cloud Resources, Bandwidth and Deployment Costs in Multi-Providers Network Function Virtualization Environment , 2019, IEEE Access.

[20]  Ying-Dar Lin,et al.  Energy Cost Optimization in Dynamic Placement of Virtualized Network Function Chains , 2018, IEEE Transactions on Network and Service Management.

[21]  Rebecca Steinert,et al.  Metron: NFV Service Chains at the True Speed of the Underlying Hardware , 2018, NSDI.

[22]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[23]  Baojia Li,et al.  Deep-learning-assisted network orchestration for on-demand and cost-effective VNF service chaining in inter-DC elastic optical networks , 2018, IEEE/OSA Journal of Optical Communications and Networking.

[24]  F. G. Lavacca,et al.  Computing and Bandwidth Resource Allocation in Multi-Provider NFV Environment , 2018, IEEE Communications Letters.

[25]  Ren Wang,et al.  HALO: Accelerating Flow Classification for Scalable Packet Processing in NFV , 2019, 2019 ACM/IEEE 46th Annual International Symposium on Computer Architecture (ISCA).

[26]  Yaohui Jin,et al.  Intelligent timeout master: Dynamic timeout for SDN-based data centers , 2015, 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM).

[27]  Carlos Pignataro,et al.  Service Function Chaining (SFC) Architecture , 2015, RFC.

[28]  Michael Segal,et al.  Space and Speed Tradeoffs in TCAM Hierarchical Packet Classification , 2008, 2008 IEEE Sarnoff Symposium.

[29]  Abdallah Shami,et al.  Orchestrating network function virtualization platform: Migration or re-instantiation? , 2017, 2017 IEEE 6th International Conference on Cloud Networking (CloudNet).

[30]  Qianbin Chen,et al.  Virtual Network Function Migration Based on Dynamic Resource Requirements Prediction , 2019, IEEE Access.

[31]  Hoang Minh Nguyen,et al.  Host load prediction in cloud computing using Long Short-Term Memory Encoder–Decoder , 2019, The Journal of Supercomputing.