Quantitative understanding serial-parallel hybrid sfc services: a dependability perspective

Bai, Jing; Chang, Xiaolin; Machida, Fumio; Han, Zhen; Xu, Yang; Trivedi, Kishor S.

doi:10.1007/s12083-022-01329-0

Cited by 7 publications

(3 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We perform simulations based on two real network topologies, RNP and BICS, which are available through http://www.topology-zoo.org 44 . These topologies have different sizes to examine the dependence of placement methods on the scale of the problem.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic service function chains placement based on parallelized requests in edge computing environment

Guo,

Rezaeipanah

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The advent of Network Function Virtualization (NFV) technology brings flexible traffic engineering to edge computing environments. Online services in NFV are chained as Service Function Chains (SFCs), which consist of ordered sequences of Virtual Network Functions (VNFs). The SFC Placement (SFCP) problem is solved under Quality of Service (QoS) requirements and limited resource availability by directing traffic to the required VNFs. However, SFC assembly leads to high latency and network congestion by increasing the count of VNFs, which parallelized SFC can overcome this problem. With parallelizing an SFC request, independent VNFs are activated simultaneously and computational acceleration is realized by reducing the SFC length. Any pair of VNFs that do not conflict with traffic can be activated simultaneously. Most VNFs are deployed on distributed servers for load balancing, which makes SFC parallelization challenging. Meanwhile, the cost of merging/duplicating packets for parallelized SFCs between different servers is not negligible. Hence, in this article, Distributed Parallel Chaining (DPC) is proposed which is an algorithm based on Deep Reinforcement Learning (DRL) approaches. The DPC algorithm solves the SFCP problem to maximize the Long‐Term Expected Cumulative Reward (LTECR). DPC incorporates an Asynchronous Advantage Actor‐Critic (A3C) algorithm as a new approach based on DRL to increase the admission ability of future SFC requests by maximizing LTECR. The evaluation results show the effectiveness of the proposed algorithm from different aspects. Specifically, compared to the best existing approaches, DPC can reduce SFC latency by 8.7%.

show abstract

Section: Resultsmentioning

confidence: 99%

“…topology-zoo.org. 44 These topologies have different sizes to examine the dependence of placement methods on the scale of the problem. The RNP has 28 nodes and 33 links, where it describes the Geo location for the country Brazil.…”

Section: Simulation Settingsmentioning

confidence: 99%

Dynamic service function chains placement based on parallelized requests in edge computing environment

Guo,

Rezaeipanah

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…There have been many solutions proposed for optimizing the delay in SFC deployment, such as improving the performance of individual VNFs [49,50] and modularizing VNFs [51]. However, these optimization approaches are all based on serial chaining, and processing SFC in parallel can greatly reduce the theoretical delay.…”

Section: Parallel Processing Of Sfcmentioning

confidence: 99%

Intelligent Deployment of Delay-Sensitive Service Function Chain Based on Parallelization and Improved Cuckoo Search Algorithm

Zhao,

Kang,

Wang

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

As one of the key focuses in 6G research, the space–air–ground integrated network incorporates a variety of technological frameworks. Network function virtualization allows network functions to be deployed on general servers in the form of software and creates a service function chain (SFC) according to user service requirements. In recent years, the deployment of SFC has become popular research due to the increasing demand for low delay in network application scenarios. Low delay is a crucial indicator of the quality of service, especially for delay-sensitive applications. To address this issue, we propose a method for the deployment of delay-sensitive SFC based on parallelization and the improved cuckoo search (ICS) algorithm (DDSSFC-PICS). This method optimizes the composition and deployment of SFC jointly. First, the serial structure of the SFC is transformed into a parallel structure by determining the dependency of virtual network functions, which reduces the length of the SFC and thereby reduces delay. Second, with the optimization goal of minimizing network delay, a parallel SFC deployment model is established under constraints including packet loss rate and resource availability. Finally, the ICS algorithm is applied for optimization, where delay is used as the fitness measure. By improving the Lévy flight step size and drawing inspiration from the whale algorithm, the performance of the cuckoo search (CS) algorithm is enhanced, leading to a further reduction in delay. The simulation results show that using the same CS deployment method, parallelized SFC has a significantly lower delay compared to serial SFC. Furthermore, the DDSSFC-PICS reduces the delay by 22.58% and 19.02%, respectively, compared with the CS deployment and particle swarm optimization SFC deployment methods.

show abstract

Availability and Reliability of Service Function Chain: A Quantitative Evaluation View

Bai

Chang

et al. 2023

Int J Comput Intell Syst

View full text Add to dashboard Cite

Service function chain (SFC) based on network function virtualization (NFV) technology can handle network traffic flexibly and efficiently. The virtual network function (VNF), as the core function unit of SFC, can experience software aging, which reduces the availability and reliability of SFC and even leads to service interruption, after it runs continuously for a long time. Software rejuvenation technique can effectively combat software aging. However, its effectiveness in improving the availability and reliability of SFC needs to be evaluated. Compared with existing models, this paper proposes a semi-Markov model to capture the behaviors of each VNF in a SFC from the occurrence of software aging to recovery by software rejuvenation technique under the condition that the failure times and recovery times follow general distribution, while considering trigger intervals of software rejuvenation technique. We then derive the calculation formulas of the steady-state availability, transient availability, and reliability, which are applied to evaluate the effectiveness of software rejuvenation technique. Finally, we conduct sensitivity analysis and numerical experiments to analyze the effects of system parameters, the number of VNFs and trigger interval of software rejuvenation technique on availability and reliability of SFC, and the effects of time-varying parameters on transient availability of SFC.

show abstract

Quantitative understanding serial-parallel hybrid sfc services: a dependability perspective

Cited by 7 publications

References 45 publications

Dynamic service function chains placement based on parallelized requests in edge computing environment

Dynamic service function chains placement based on parallelized requests in edge computing environment

Intelligent Deployment of Delay-Sensitive Service Function Chain Based on Parallelization and Improved Cuckoo Search Algorithm

Availability and Reliability of Service Function Chain: A Quantitative Evaluation View

Contact Info

Product

Resources

About