GLOBECOM 2017 - 2017 IEEE Global Communications Conference 2017
DOI: 10.1109/glocom.2017.8254492
|View full text |Cite
|
Sign up to set email alerts
|

Resource-Efficient Virtual Network Function Placement in Operator Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…Similar to the work presented in [59], Song et al [94] presented a solution to minimize the number of CPU cores and the communication resources, in terms of link bandwidth; but in generic distributed networks. An ILP formulation was proposed to minimize the objective function considering several constraints in terms of computing resources capacity, link capacity, and order of VNFs within a SFC.…”
Section: Resource Utilizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Similar to the work presented in [59], Song et al [94] presented a solution to minimize the number of CPU cores and the communication resources, in terms of link bandwidth; but in generic distributed networks. An ILP formulation was proposed to minimize the objective function considering several constraints in terms of computing resources capacity, link capacity, and order of VNFs within a SFC.…”
Section: Resource Utilizationmentioning
confidence: 99%
“…Most works that addressed the resources utilization optimization focused on links resources, but with different concerning. The work presented by Shang et al [88] focused on to minimize the maximum link load, while other focused on to minimize the bandwidth consumption [58,53,17,59,94]. Although the objective is similar (minimizing the resource consumption of the links), these different approaches result in different mathematical formulations.…”
Section: Resource Utilizationmentioning
confidence: 99%
“…They formulated the model as an Integer Non-Linear Programming (INLP) problem based on the latency requirements, however, under certain conditions, the delay constraints are not enough to fulfill all the needs for having a reliable SFC orchestration system; more constraints need to be considered to strength their proposal. Song et al [14] treat the problem of obtaining an optimal placement of network functions in the operators' networks. They formulated an Integer Linear Programming (ILP) problem to demonstrate the trade-off between the network cost and the computing resources cost.…”
Section: Related Workmentioning
confidence: 99%
“…In [20] the authors consider the problem of allocating the minimum quantity of resources to perform the VNF placement in a two-level hierarchical geo-distributed infrastructure, proposing both an ILP and a Tabu Search heuristic algorithm. In [21] the usage of both computing and communication resources are balanced into a bi-objective optimization problem, which is proved to be NP-hard. The authors, propose an ILP together with a greedy heuristic: each service chain is sequentially deployed over network nodes, in such a way that the nodes causing less resource usage increment are the ones having higher probability of being chosen.…”
Section: Related Workmentioning
confidence: 99%