A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks.
Rafael ColaresAmal BenamicheYannick CarlinetNancy PerrotPublished in: INOC (2022)
Keyphrases
- dynamic programming
- np hard
- learning algorithm
- preprocessing
- significant improvement
- optimization algorithm
- experimental evaluation
- worst case
- improved algorithm
- recognition algorithm
- convergence rate
- times faster
- wireless networks
- detection algorithm
- theoretical analysis
- computational cost
- k means
- high accuracy
- simulated annealing
- input data
- computationally efficient
- segmentation algorithm
- cost function
- tree structure
- classification algorithm
- computational complexity
- genetic algorithm
- probabilistic model
- objective function
- optimal solution
- convex hull
- multi objective