2017
DOI: 10.1007/978-3-319-67235-9_13
|View full text |Cite
|
Sign up to set email alerts
|

Near-Optimal Placement of Virtualized EPC Functions with Latency Bounds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…In [36], Bagaa et al address the placement of virtual instances of 4G (MME, SGW, PGW) and 5G (AMF, SMF and AUSF) core network elements over a federated cloud based on Mixed Integer Linear Programming and coalitional formation game. Finally, Dietrich et al [37] formulate a mixed-integer linear program for the vSGW and vMME embedding. To reduce its time complexity, they transform it into a linear program by employing relaxation and rounding techniques.…”
Section: T (Max) Ifmentioning
confidence: 99%
See 1 more Smart Citation
“…In [36], Bagaa et al address the placement of virtual instances of 4G (MME, SGW, PGW) and 5G (AMF, SMF and AUSF) core network elements over a federated cloud based on Mixed Integer Linear Programming and coalitional formation game. Finally, Dietrich et al [37] formulate a mixed-integer linear program for the vSGW and vMME embedding. To reduce its time complexity, they transform it into a linear program by employing relaxation and rounding techniques.…”
Section: T (Max) Ifmentioning
confidence: 99%
“…11c and 12c. In scenarios where the candidate ECs have a limited capacity, the distributed approach, included in PES, would improve the request acceptance and infrastructure utilization [37]. It is also appropriate for the planning of large geographical areas where the centralized approach could not meet the delay constraints, due to the high propagation delays.…”
Section: B Epc Network Slices Planningmentioning
confidence: 99%