Fault Tolerant Service Function Chaining

Ghaznavi, Milad; Jalalpour, Elaheh; Wong, Bernard; Boutaba, Raouf; Mashtizadeh, Ali José

doi:10.1145/3387514.3405863

Cited by 24 publications

(11 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Em [Ghaznavi et al 2020] os autores propõem FTC (Fault Tolerant Chaining), um sistema para prover tolerância a falhas crash para SFCs. Através do próprio processamento dos pacotes, o sistema FTC extrai informac ¸ões sobre o estado das VNFs.…”

Section: Trabalhos Relacionadosunclassified

“…Apesar de que estratégias diversas para a construc ¸ão de servic ¸os virtuais tolerantes a falhas já foram propostos [Venâncio et al 2021, Ghaznavi et al 2020, Qu et al 2016, todos consideram apenas falhas por parada (crash) de VNFs. Sendo assim, este trabalho propõe uma nova estratégia para a replicac ¸ão, mapeamento e tolerância a falhas em SFCs que considera a possibilidade dos três componentes (VNF, SC e SFF) da arquitetura SFC da IETF sofrerem falhas crash ou intrusão (falhas bizantinas).…”

Section: Introduc ¸ãOunclassified

See 1 more Smart Citation

Arquitetura e Mapeamento de Serviços Virtualizados de Rede Tolerantes a Falhas e Intrusão

Fülber-Garcia¹,

Venâncio²,

Duarte³

2022

Anais Do XXIII Workshop De Testes E Tolerância a Falhas (WTF 2022)

View full text Add to dashboard Cite

A arquitetura para serviços virtuais de rede da IETF define Service Function Chains (SFCs) como composições de múltiplas Virtualized Network Functions (VNFs). As SFCs são baseadas em componentes para o encaminhamento de tráfego, principalmente os classificadores Service Classifiers (SCs) e encaminhadores Service Function Forwarders (SFFs) de tráfego. Este trabalho apresenta uma nova estratégia para replicar, mapear e tolerar falhas por parada e intrusão de todos os componentes da arquitetura de SFC da IETF; trabalhos anteriores consideram apenas falhas por parada de VNFs. Assume-se um ambiente federado com múltiplos domínios candidatos a hospedarem instâncias de VNF, SC e SFF. Os componentes de encaminhamento são replicados, sendo então mapeados no ambiente federado utilizando otimização baseada em critérios de conectividade. Uma heurística genética é proposta, além de solução exata baseada em programação linear inteira. Resultados mostram a eficiência da heurística e que retorna resultados próximos ao ótimo. Além disso, um protótipo da estratégia proposta foi implementado e demostrou a capacidade de manter o serviço disponível sob falhas por parada e intrusão resultante de ataque man-in-the-middle.

show abstract

Section: Trabalhos Relacionadosunclassified

Section: Introduc ¸ãOunclassified

Arquitetura e Mapeamento de Serviços Virtualizados de Rede Tolerantes a Falhas e Intrusão

Fülber-Garcia¹,

Venâncio²,

Duarte³

2022

Anais Do XXIII Workshop De Testes E Tolerância a Falhas (WTF 2022)

View full text Add to dashboard Cite

show abstract

“…Recent frameworks allow the application states to be directly transferred between the application instances. The frameworks [31], [50], [51] reduced the network overhead by introducing a compact format for the application states. These studies strive to fulfill the low-latency (R1) requirement, but their designs couple packet processing and state processing when handling user requests, i.e., the application states are stored locally at the source instance.…”

Section: Related Work On State Transfer Frameworkmentioning

confidence: 99%

FAST: Flexible and Low-Latency State Transfer in Mobile Edge Computing

et al. 2021

View full text Add to dashboard Cite

Mobile Edge Computing (MEC) brings the benefits of cloud computing, such as computation, networking, and storage resources, close to end users, thus reducing end-to-end latency and enabling various novel use cases, such as vehicle platooning, autonomous driving, and the tactile internet. However, frequent user mobility makes it challenging for the MEC to guarantee the close proximity to the users. To tackle this challenge, the underlying network has to be capable of seamlessly migrating applications between multiple MEC sites. This application migration requires the quick and flexible migration of the application states without service interruption, while minimizing the state transfer cost. In this article, we first study the state transfer optimization problem in the MEC. To solve this problem, we propose a metaheuristic algorithm based on Tabu search. We then propose Flexible and Low-Latency State Transfer in Mobile Edge Computing (FAST), the first programmable state forwarding framework. FAST flexibly and directly forwards states between source instance and destination instance based on Software-Defined Networking (SDN). Both simulation results and practical testbed results demonstrate the favorable performance of the proposed Tabu search algorithm and the FAST framework compared to the state-of-the-art schemes.INDEX TERMS Application state transfer, multi-access edge computing (MEC), network function virtualization (NFV), software-defined networking (SDN).

show abstract

“…Delivering SFCs in such applications needs to provide fault tolerance against failures of both physical component (e.g., node or link) and software (e.g., SF instance). Most existing research concentrated on fault tolerance of a network [11]- [19], but few works have focused on fault-tolerant mechanisms of the SFC delivery [20]- [23]. In [22], two disjoint SFPs (primary and backup) are established to tolerate a single node, link, or SF instance failure.…”

Section: Introductionmentioning

confidence: 99%

Service Function Chaining with Deterministic Fault Tolerance in Optical Edge Networks

Zheng¹,

Shen²,

Li³

et al. 2021

Preprint

View full text Add to dashboard Cite

In the upcoming 5G-and-beyond era, ultra-reliable low-latency communication (URLLC) services will be ubiquitous in edge networks. To improve network performance and quality of service (QoS), URLLC services could be delivered via a sequence of software-based network functions, also known as service function chains (SFCs). Towards reliable SFC delivery, it is imperative to incorporate deterministic fault tolerance during SFC deployment. However, deploying an SFC with deterministic fault tolerance is challenging because the protection mechanism needs to consider protection against physical/virtual network failures and hardware/software failures jointly. Against multiple and diverse failures, this work investigates how to effectively deliver an SFC in optical edge networks with deterministic fault tolerance while minimizing wavelength resource consumption. We introduce a protection augmented graph, called k-connected service function slices layered graph (KC-SLG), protecting against k-1 fiber link failures and k-1 server failures. We formulate a novel problem called deterministic-fault-tolerant SFC embedding and propose an effective algorithm, called most candidate first SF slices layered graph embedding (MCF-SE). MCF-SE employs two proposed techniques: k-connected network slicing (KC-NS) and k-connected function slicing (KC-FS). Through thorough mathematical proof, we show that KC-NS is 2-approximate. For KC-FS, we demonstrate that k = 3 provides the best cost-efficiency. Our experimental results also show that the proposed MCF-SE achieves deterministic-fault-tolerant service delivery and performs better than the schemes directly extended from existing work regarding survivability and average cost-efficiency.

show abstract

Fault Tolerant Service Function Chaining

Cited by 24 publications

References 30 publications

Arquitetura e Mapeamento de Serviços Virtualizados de Rede Tolerantes a Falhas e Intrusão

Arquitetura e Mapeamento de Serviços Virtualizados de Rede Tolerantes a Falhas e Intrusão

FAST: Flexible and Low-Latency State Transfer in Mobile Edge Computing

Service Function Chaining with Deterministic Fault Tolerance in Optical Edge Networks

Contact Info

Product

Resources

About