2021
DOI: 10.1109/tnsm.2021.3087838
|View full text |Cite
|
Sign up to set email alerts
|

Throughput Optimization and Delay Guarantee VNF Placement for Mapping SFC Requests in NFV-Enabled Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 38 publications
(20 citation statements)
references
References 40 publications
0
20
0
Order By: Relevance
“…where µ * (q) i→ (t) and µ * (q) →i (t) are defined in (6). Furthermore, in (29b) (in Appendix C), we show…”
Section: Appendix B Multicast Network Stability Regionmentioning
confidence: 63%
See 1 more Smart Citation
“…where µ * (q) i→ (t) and µ * (q) →i (t) are defined in (6). Furthermore, in (29b) (in Appendix C), we show…”
Section: Appendix B Multicast Network Stability Regionmentioning
confidence: 63%
“…With the advent of software defined networking (SDN) and network function virtualization (NFV), network services can be deployed as a sequence of software functions or service function chains (SFCs) that can be flexibly interconnected and elastically executed at distributed cloud locations [4]. A number of studies have investigated the problem of joint SFC placement and routing with the objective of either maximizing accepted service requests [5], [6], or minimizing overall resource cost [7], [8]. Nonetheless, these solutions exhibit two main limitations: first, April 20, 2022 DRAFT the problem is formulated as a static optimization problem without considering the dynamic nature of service requests, a critical aspect in next-generation AgI services; second, due to the combinatorial nature of the problem, the corresponding formulations typically take the form of (NP-hard) mixed integer linear programs, and either heuristic solutions or loose approximation algorithms are developed, compromising the quality of the resulting solution.…”
Section: A Related Workmentioning
confidence: 99%
“…With the advent of software defined networking (SDN) and network function virtualization (NFV), network (and, by extension, AgI) services can be deployed as a sequence of software functions or service function chains (SFCs) instantiated over distributed cloud locations. A number of studies have investigated the problem of joint SFC placement and routing over multi-hop networks with the objective of either minimizing overall operational cost [10]- [13], or maximizing accepted service requests [14]- [16]. Nonetheless, these solutions exhibit two main drawbacks.…”
Section: A Related Workmentioning
confidence: 99%
“…First, the problem is formulated as a static optimization problem without considering the dynamic nature of service requests. In addition, when it comes to delay performance, these studies mainly focus on propagation delay [12]- [15], while neglecting queuing delay, or using simplified models (e.g., M/M/1) to approximate it [16]. Second, due to the combinatorial nature of the problem, the corresponding formulations typically take the form of (NPhard) mixed integer linear programs and either heuristic or loose approximation algorithms are developed, compromising the quality of the resulting solution.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation