Abstract

As a novel network architecture, network function virtualization (NFV) greatly improves the flexibility and scalability of service provision. Deploying the service function chain (SFC) in an NFV environment needs to coordinate the instantiation of the virtual network function descriptor, network function embedding, and traffic steering, which also improves the complexity of the problem. Although heuristic algorithms are widely used to optimize this problem, due to the lack of complete SFC deployment solution space and digital coding scheme, the time complexity of the algorithm is difficult to meet the requirements. Therefore, this paper studies the digital coding scheme of the heuristic SFC deployment to improve time efficiency without reducing performance. Firstly, we model the SFC deployment as a 0–1 integer linear programming, considering the above factors, and then design a continuous digital solution space construction scheme based on N-Base coding (NBACO-SS) to optimize the above problems. NBACO-SS uses integer size and carry to map the complex SFC deployment to simple digital coding, evaluates the continuity of solution space through the Manhattan distance, and optimizes the continuity through the ant colony algorithm. Based on NBACO-SS, we reconstruct two heuristic algorithms to solve the SFC deployment problem. Experimental results demonstrate that NBACO-SS can improve the time efficiency by 20% without reducing the total network service traffic.

Highlights

  • IntroductionNetwork function virtualization (NFV) [1] is a novel network architecture, which decouples software and hardware, and realizes the network functions originally realized by expensive special hardware with virtualization technology on the commercial server (such as the firewall, WAN accelerator, and traffic Monitor), which is called virtual network function (VNF)

  • Network function virtualization (NFV) [1] is a novel network architecture, which decouples software and hardware, and realizes the network functions originally realized by expensive special hardware with virtualization technology on the commercial server, which is called virtual network function (VNF)

  • The service function chain (SFC) deployment model in the NFV scenario is shown in Figure 1, which is divided into three layers: network function virtualization infrastructure (NFVI), virtual network Electronics 2022, 11, x FOR PEER REVfuIEnWction, and user service

Read more

Summary

Introduction

Network function virtualization (NFV) [1] is a novel network architecture, which decouples software and hardware, and realizes the network functions originally realized by expensive special hardware with virtualization technology on the commercial server (such as the firewall, WAN accelerator, and traffic Monitor), which is called virtual network function (VNF). These schemes only combine the local optimization avoidance strategy of heuristic algorithms with the deployment of SFC, and the lack of systematic analysis of SFC deployment solution space and the corresponding digital-domain mapping scheme The operations, such as instantiation VNFD selection, network function embedding, and traffic routing cannot be described abstractly, which makes the algorithm design complex.

SFC Deployment Mathematical Model
Heuristic Algorithm for SFC Deployment Optimization
System Model and Problem Description
F C 1 fin Spoouirncte nf1
User Service
Traffic Steer
Decision Model and Optimization Objective
Heuristic SFC Deployment Algorithm Based on N-Base Continuous Digital Coding
Solution Space Generation Scheme Based on N-Base Coding
Performance Evaluation
Simulation Environment and Design
Continuity Evaluation of NBACO-SS
Findings
50 NBACO-SS Theoretical-Boundary
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call