Optimized Service Function Path Scaling in SDN/NFV Networks

2019 ◽  
Author(s):  
Faqiang Liu ◽  
Peng Li ◽  
Shengxiang Gao ◽  
Xin Wan ◽  
Wei An
Keyword(s):  
Service Function

scholarly journals Don’t interrupt me when you reconfigure my Service Function Chains

2021 ◽  
Vol 171 ◽  
pp. 39-53
Author(s):  
Adrien Gausseran ◽  
Andrea Tomassilli ◽  
Frederic Giroire ◽  
Joanna Moulierac
Keyword(s):  
Service Function

Improving dynamic service function chaining classification in NFV/SDN networks through the offloading concept

2020 ◽  
Vol 182 ◽  
pp. 107480
Author(s):  
Marco Polverini ◽  
Jaime Galán-Jiménez ◽  
Francesco G. Lavacca ◽  
Antonio Cianfrani ◽  
Vincenzo Eramo
Keyword(s):  
Service Function

scholarly journals Efficient Placement of Service Function Chains in Cloud Computing Environments

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 323
Author(s):  
Marwa A. Abdelaal ◽  
Gamal A. Ebrahim ◽  
Wagdy R. Anis
Keyword(s):  
Energy Consumption ◽  
Load Balancing ◽  
Response Time ◽  
Optimization Problem ◽  
Service Providers ◽  
Virtual Network ◽  
Placement Problem ◽  
Service Function ◽  
Network Functions ◽  
Bandwidth Consumption

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

The Anomaly Detection Mechanism Using Extreme Learning Machine for Service Function Chaining

2020 ◽  
Author(s):  
Sheng-Tzong Cheng ◽  
Chong-Yi Zhu ◽  
Chih-Wei Hsu ◽  
Jia-Shing Shih
Keyword(s):  
Anomaly Detection ◽  
Extreme Learning Machine ◽  
Detection Mechanism ◽  
Service Function ◽  
Learning Machine

On the Effective Parallelization and Near-Optimal Deployment of Service Function Chains

2021 ◽  
Vol 32 (5) ◽  
pp. 1238-1255
Author(s):  
Jianzhen Luo ◽  
Jun Li ◽  
Lei Jiao ◽  
Jun Cai
Keyword(s):  
Service Function ◽  
Optimal Deployment
Sign in / Sign up

Export Citation Format

Share Document