2015 IFIP/IEEE International Symposium on Integrated Network Management (IM) 2015
DOI: 10.1109/inm.2015.7140281
|View full text |Cite
|
Sign up to set email alerts
|

Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
221
0
11

Year Published

2015
2015
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 340 publications
(232 citation statements)
references
References 9 publications
0
221
0
11
Order By: Relevance
“…Luizelli et al [154] formalized the NF placement and chaining problem as an integer linear programming (ILP) optimization model and proposed a heuristic procedure to solve the optimization model. They considered three basic types of SFC components: (i) line, (ii) bifurcated path with different endpoints, and (iii) bifurcated path with a single endpoint.…”
Section: Resource Managementmentioning
confidence: 99%
“…Luizelli et al [154] formalized the NF placement and chaining problem as an integer linear programming (ILP) optimization model and proposed a heuristic procedure to solve the optimization model. They considered three basic types of SFC components: (i) line, (ii) bifurcated path with different endpoints, and (iii) bifurcated path with a single endpoint.…”
Section: Resource Managementmentioning
confidence: 99%
“…For this reason, the problem of VNF placement has been attracting increasing attention during the last years [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25]. Nonetheless, the optimal placement of virtual elements to physical resources aimed at minimizing power consumption with service performance constraints for the 5G scenario under study is a complex issue.…”
Section: Related Workmentioning
confidence: 99%
“…Various models have been built using MIQCP [21], MILP [22][23][24], and ILP [12,[25][26][27], which optimize different parameters such as end-toend latency and resource utilization. We analyze them from the aspect of their solving methods.…”
Section: Related Workmentioning
confidence: 99%
“…Improper time setting may affect quality of solutions. Similarly, based on introducing binary search, the method in [25] limits the execution time of CPLEX in each iteration. Bari et al [12] use Viterbi algorithm to find a near-optimal placement of instances from multistage directed graph.…”
Section: Related Workmentioning
confidence: 99%