A Solving Method for Computing and Network Resource Minimization Problem in Service Function Chain Against Multiple VNF Failures

Yamada, Daiki; Shinomiya, Norihiko

doi:10.1109/cic48465.2019.00013

Cited by 5 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [10], every considered SFC in the simulation includes three VNFs. The proposed algorithm in [21] also considered three VNFs for each SFC in their simulation. The number of VNFs is randomly selected for each SFC in [25] and is considered between one and seven.…”

Section: Evaluation Approaches and Simulation Setupmentioning

confidence: 99%

“…It can predict the next VNF failure and limit the overall recovery delay. In [21], a SFC routing based on the K-node disjoint shortest path and VNF deployment is proposed. It is a heuristic algorithm that aims to minimize computing and network resource consumption.…”

Section: Evaluation Approaches and Simulation Setupmentioning

confidence: 99%

“…VNF Failure Link Failure ZT-PFR [10] JPV-ABA [18] P-E2E [22] DDQP [25] MP-VPS [20] CS-VA [49] Proposed algorithm [21] BS-PUSH-BS-Pull [42] N+P [19] EVNFO [24] Proposed algorithm [50] 4.2.2. Occurrence of the Failure Real-world applications are prone to failure.…”

Section: Algorithmmentioning

confidence: 99%

“…The authors in [19] used replicas to replace a single VNF handling a failure by increasing its resiliency. In [21], the algorithm's main goal is to handle multiple failures. The authors consider failure multiplicity, in other words, multiple simultaneous failures.…”

Section: Algorithmmentioning

confidence: 99%

“…The results shown in [20] confirms that multipath protection performs better in blocking probability and spectrum efficiency compared to single-path protection. On the other hand, in [21], the K-node disjoint shortest path algorithm is used to handle the survivability of VNFs against multiple failures. K-node is a modified Dijkstra algorithm that aims to decrease the failure rate while minimizing computing and network resource usage.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Systematic Literature Review of Reliable Provisioning for Virtual Network Function Chaining

Ghahroudi

Ponce

2023

Applied Sciences

View full text Add to dashboard Cite

The abstraction of the network node functions using virtualization methods introduced an innovative architecture called Network Function Virtualization (NFV). In NFV, every virtualization software hosts a network service recognized as a Virtual Network Function (VNF). In general, the network provider creates a Service Function Chain (SFC) for every sequence of multiple requested VNFs by the customers. Although NFV allows for a more flexible and economical approach, it is more prone to error and failure. Therefore, providing reliable provisioning for VNF chaining is one of the key issues in NFV. In this paper, we present a systematic literature review to study the pioneer research efforts that provide reliable provisioning for VNF chaining by guaranteeing the availability of the service and resource optimization. Our review is the result of the analysis of 21 screened papers. This paper presents the result of our analysis, including different aspects of a reliable provisioning algorithm, various adopted techniques for reliable provisioning, and the superiority and drawbacks of each algorithm based on the proposed criteria for the evaluation of the provisioning algorithms.

show abstract

Section: Evaluation Approaches and Simulation Setupmentioning

confidence: 99%

Section: Evaluation Approaches and Simulation Setupmentioning

confidence: 99%