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 paper 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.

A scalable and offloading-based traffic classification solution in NFV/SDN network architectures

Cianfrani A.;
2021-01-01

Abstract

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 paper 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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11695/130986
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 4
social impact