P4-based implementation of BIER and BIER-FRR for scalable and resilient multicast

Merling, Daniel; Lindner, Steffen; Menth, Michael

doi:10.1016/j.jnca.2020.102764

Cited by 13 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…É importante destacar que essa estratégia é viável porque o mecanismo ECMP, ao operar com múltiplos caminhos alternativos instalados no plano de dados, não depende de elementos externos para a recuperac ¸ão de falhas. Na linguagem P4, o FRR e o ECMP são componentes separados [Merling et al 2020, Sivaraman et al 2015, exigindo esforc ¸o de desenvolvimento para sua integrac ¸ão no plano de dados. Discutimos mais sobre a integrac ¸ão desses componentes na Sec ¸ão 4.…”

Section: Fundamentac ¸ãO Teóricaunclassified

See 1 more Smart Citation

RESISTING: Um Novo Mecanismo de Fast-Reroute com Distribuição de Pacotes em Switches Programáveis P4

Lima

Vogt

Silva

et al. 2023

Anais Do XXVIII Workshop De Gerência E Operação De Redes E Serviços (WGRS 2023)

View full text Add to dashboard Cite

Os mecanismos de Fast-Reroute (FRR) operam na recuperação de falhas em diversas arquiteturas de redes, prevenindo a degradação dos fluxos de pacotes das aplicações. Os trabalhos que suportam mecanismos de FRR na arquitetura de switches programáveis na linguagem Programming Protocol-independent Packet Processor (P4) aplicam uma abordagem de recuperação de falhas sem considerar um método de distribuição de fluxos de pacotes. Deste modo, essas soluções não contribuem para um uso eficiente dos recursos de banda, que pode causar sobrecarga nos links durante a recuperação de cenários drásticos de falhas. O presente trabalho propõe RESISTING como um novo mecanismo de FRR Equal-Cost Multi-Path (ECMP) para switches programáveis em P4, oferecendo balanceamento dos fluxos de pacotes durante a recuperação de falhas. O mecanismo de recuperação proposto é comparado ao Primitive for Reconfigurable Fast Reroute (PURR) – mecanismo considerado o estado da arte – durante os eventos de uma, duas e três falhas. Os resultados mostram que o método proposto não apresenta perda de fluxos de pacotes durante a avaliação experimental, ao passo que o PURR apresenta perdas a partir de duas falhas simultâneas.

show abstract

Section: Fundamentac ¸ãO Teóricaunclassified

“…Os mecanismos FRR apresentados nos trabalhos [Merling et al 2020, Chiesa et al 2019] permitem a recuperac ¸ão de falhas sem prejudicar a latência e a vazão dos fluxos de pacotes. No entanto, esses trabalhos adotaram uma estratégia primária de recuperac ¸ão que não leva em considerac ¸ão a quantidade de links operacionais no data center.…”

Section: Introduc ¸ãOunclassified

RESISTING: Um Novo Mecanismo de Fast-Reroute com Distribuição de Pacotes em Switches Programáveis P4

Lima

Vogt

Silva

et al. 2023

Anais Do XXVIII Workshop De Gerência E Operação De Redes E Serviços (WGRS 2023)

View full text Add to dashboard Cite

show abstract

“…We suggest using a BIER header, among other things, that contains a special field called the Bit-String (BS) (Figure 6). The Bit-String is an array of bits, in which each bit indicates exactly one specific router in the BIER domain [73,74]. The BS field allows the B-REP algorithm to efficiently carry an alternative path.…”

Section: The B-rep Mechanismmentioning

confidence: 99%

Enhanced Bit Repair IP Fast Reroute Mechanism for Rapid Network Recovery

2021

View full text Add to dashboard Cite

The massive development of virtualized infrastructures, Internet of Things (IoT), and Wireless Sensor Network (WSN) in recent years has led to an increase in quality requirements for the management and reliability of underlay communication networks. Existing converged networks must therefore guarantee specific quantitative and qualitative parameters of different network communication services to meet customer requirements. However, the quality of the services operated is very negatively affected by an unpredictable failure of a communication link or a network node. In such situations, communication is typically interrupted for a period that is difficult to predict, and which can lead to significant financial losses and other negative effects. Internet Protocol Fast Reroute (IP FRR) technology was developed for these reasons. The paper presents the proposal of the new Enhanced Bit Repair (EB-REP) IP FRR mechanism, which offers significant improvements over its predecessor, the B-REP mechanism. The B-REP offers protection against a single failure and only for selected critical IP flows. The EB-REP provides advanced protection against multiple failures in a protected network domain and the protection can be provided for all network flows. The EB-REP calculates alternative paths in advance based on link metrics, but also allows the construction of alternative paths independently of them. The construction of alternative FRR paths uses a standardized tunneling approach via a unique field Bit-String. Thanks to these features, EB-REP is an advanced contribution to solving IP FRR-related problems, which enables the use of EB-REP in many network deployments, but especially in network solutions that require reliable data transmission.

show abstract

“…This solution completely relies therefore on the unicast routing to forward multicast packets to the destination nodes. Since its first appearance, BIER attracted much attention for its simplicity, and works have been presented to enhance its basic functionality, for instance, with reliable multicast transmission [31], packet caching for fast retransmission [32], and fast reroute in case of failure [33].…”

Section: Brief Overview Of Multicast Routing In the Internetmentioning

confidence: 99%

A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

2021

View full text Add to dashboard Cite

With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements.

show abstract

P4-based implementation of BIER and BIER-FRR for scalable and resilient multicast

Cited by 13 publications

References 8 publications

RESISTING: Um Novo Mecanismo de Fast-Reroute com Distribuição de Pacotes em Switches Programáveis P4

RESISTING: Um Novo Mecanismo de Fast-Reroute com Distribuição de Pacotes em Switches Programáveis P4

Enhanced Bit Repair IP Fast Reroute Mechanism for Rapid Network Recovery

A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

Contact Info

Product

Resources

About