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

Guaranteed-Availability Network Function Virtualization with Network Protection and VNF Replication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0
3

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 52 publications
(27 citation statements)
references
References 12 publications
0
24
0
3
Order By: Relevance
“…Virtual network functions (VNFs) are network services that provide some network functionality and provide flexible ways to deploy network services [438]. The study in [257] focuses on the QoS-aware VNF placement and provisioning problem over an edgecloud infrastructure.…”
Section: Resource Management and Provisioningmentioning
confidence: 99%
“…Virtual network functions (VNFs) are network services that provide some network functionality and provide flexible ways to deploy network services [438]. The study in [257] focuses on the QoS-aware VNF placement and provisioning problem over an edgecloud infrastructure.…”
Section: Resource Management and Provisioningmentioning
confidence: 99%
“…We remark that the MUGF approach circumvents the computational burden inherent in the baseline CTMC approach. Indeed, considering our example with N (m,l) = N = 14, the state space of the CTMC is worth J = 14 hierarchical decomposition of the problem as follows: 1) the steady-state distribution of each component VNF, namely a CTMC with N = 14 states, is computed by solving a system of N equations; 2) the computed distributions are combined via the series/parallel operators, which involve the standard algebraic manipulations in (16), (17) and (18). Coming to our example, step 1) of MUGF approach amounts to the solution of a system of N = 14 equations that requires about 10 ms for each VNF on a notebook based on an Intel Core i74960 HQ CPU@2.60GHz; whereas step 2) requires, for each configuration, an average time of 73 ms on the same platform, and hence about 75 s to complete the exhaustive search over 4 5 redundancy configurations.…”
Section: A Numerical Examplementioning
confidence: 99%
“…Moualla et al [28] considered the placement of service chains in DCNs, and devised an algorithm for the placement on the special fat-tree topological network structure. Kong et al [24] proposed a mechanism that employs both backup path protection and VNF instance replication in order to guarantee the availability of a service function chain. The proposed mechanism determines the number of VNF instance replicas required for each VNF in the SFC, and allocates the replicas to physical nodes on the primary and backup paths while taking into account the ordered dependency among VNFs.…”
Section: Related Workmentioning
confidence: 99%