.png){kind=icon}
Return
Optimizing Service Function Chaining Migration With Explicit Dynamic Path
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3150352.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Network Function Virtualization (NFV) can support customized on- demand network services with flexibility and cost-efficiency. Virtual Network Function (VNF) instances need to be scaled out, scaled in, and reallocated across the NFV infrastructure (NFVI) to avoid a violation of service agreements when the demand traffic changes. However, selecting the new placement of VNFs for migrating a service function chain (SFC) is an issue of efficient NFV control. We propose two novel integer linear programming (ILP) models and two approximation algorithms for SFC placement and migration to maximize the cost-efficiency of an NFV network regarding the changes of service demands and dynamic routing. The ILP models allow us to obtain the optimal solutions of SFC placement and migration with explicit dynamic paths. The approximation migration results provided by our proposed heuristic and reinforcement learning algorithms are close to the optimal solution. Evaluation results carried out with real datasets and synthetic network topologies provide a helpful suggestion of a migration strategy for an NFV service provider to optimize the operating cost of an NFV network in the long term.
Keywords:
Routing
Heuristic algorithms
Costs
Approximation algorithms
Delays
Quality of service
Optimization
NFV
SFC
service migration
optimization
machine learning
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more