Performance comparison of resilience mechanisms for stateless multicast using BIER

Braun, Wolfgang; Albert, Manuel; Eckert, Toerless; Menth, Michael

doi:10.23919/inm.2017.7987284

Cited by 17 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, there are tunneling-based mechanisms, such as Maximally Redundant Trees (MRT) [ 46 , 47 ], and, finally, IPFRR mechanisms based on alternative trees [ 22 , 48 , 49 , 50 ]. IPFRR mechanisms such as Not-Via Addresses, Multiple Routing Configurations and Maximally Redundant Trees can provide protection that is close to 100% of repair coverage [ 26 , 51 ]. The main challenge of these IPFRR mechanisms is the complexity of internal algorithms that calculate alternate paths.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Enhanced Multicast Repair Fast Reroute Mechanism for Smart Sensors IoT and Network Infrastructure

Papán

Segeč

Yeremenko

et al. 2020

Sensors

View full text Add to dashboard Cite

The sprawling nature of Internet of Things (IoT) sensors require the comprehensive management and reliability of the entire network. Modern Internet Protocol (IP) networks demand specific qualitative and quantitative parameters that need to be met. One of these requirements is the minimal packet loss in the network. After a node or link failure within the network, the process of network convergence will begin. This process may take an unpredictable time, mostly depending on the size and the structure of the affected network segment and the routing protocol used within the network. The categories of proposed solutions for these problems are known as Fast ReRoute (FRR) mechanisms. The majority of current Fast ReRoute mechanisms use precomputation of alternative backup paths in advance. This paper presents an Enhanced Multicast Repair (EM-REP) FRR mechanism that uses multicast technology to create an alternate backup path and does not require pre-calculation. This principle creates a unique reactive behavior in the Fast ReRoute area. The enhanced M-REP FRR mechanism can find an alternative path in the event of multiple links or nodes failing at different times and places in the network. This unique behavior can be applied in the IoT sensors area, especially in network architecture that guarantees reliability of data transfer.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In general, these solutions utilize precomputed multicast disjoint trees. Examples of these mechanisms are Multicast Only Fast Re-Route (MoFRR) [ 54 ] and Bit Index Explicit Replication-Traffic Engineering (BIER-TE) [ 51 , 55 ].…”

Section: Related Workmentioning

confidence: 99%

Enhanced Multicast Repair Fast Reroute Mechanism for Smart Sensors IoT and Network Infrastructure

Papán

Segeč

Yeremenko

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…BIER is essentially a point-to-multipoint tunnel without explicit tunneling states in the network, that is, BIER does not require states and signaling for multicast in core networks. The 1+1 protection mechanism based on maximally redundant trees used for BIER is described in [279], and a 1:1 FRR scheme based on point-to-multpoint reroute tunnels in [280].…”

Section: Multicast Fast Reroutementioning

confidence: 99%

A Survey of Fast Recovery Mechanisms in the Data Plane

Chiesa¹,

Kamisiński²,

Rak³

et al. 2020

Preprint

View full text Add to dashboard Cite

In order to meet their stringent dependability requirements, most modern communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art and compile open research questions.<br>

show abstract

“…Another existing, though less common IPFRR mechanisms are Equal‐cost multi‐path (ECMP), Multiple Routing Configurations (MRC), Not‐Via Addresses, tunnel based approaches, Maximally Redundant Trees (MRT) and other spanning tree based IPFRR approaches; we will not discuss these in detail. Some of existing IPFRR mechanisms can provide a high level of repair coverage reaching almost 100% (Not‐Via Addresses, MRC, MRT) . The main challenge of these IPFRR mechanisms is the complexity of internal algorithms that calculate the alternative backup paths.…”

Section: Related Workmentioning

confidence: 99%

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Papán

Segeč

Palúch

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary The network convergence time may take hundreds of milliseconds or more. Since this repair performance may be unsatisfactory, IP fast reroute (IPFRR) approaches have been developed to decrease the network convergence time and minimize traffic loss. These IPFRR mechanisms are usually based on the proactive precomputation of a backup path before a failure occurs. Once a failure is detected, the router running IPFRR will immediately use this backup path in response to the failure, rather than computing a replacement path only after a failure has occurred. The computation of an alternative path in many IPFRR mechanisms requires that the computing node (router) knows the exact network topology. In this paper, we present a new IPFRR mechanism called the multicast repair (M‐REP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers‘ (ISP‘s) core networks. The M‐REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast – Dense Mode (PIM‐DM) with the modification of an internal reverse path forwarding (RPF) check. The M‐REP IPFRR mechanism does not depend on any particular routing protocol type (distance‐vector or link‐state) and requires less system resources because of its precomputation‐less character but still provides immediate reaction to failure.

show abstract

Performance comparison of resilience mechanisms for stateless multicast using BIER

Cited by 17 publications

References 16 publications

Enhanced Multicast Repair Fast Reroute Mechanism for Smart Sensors IoT and Network Infrastructure

Enhanced Multicast Repair Fast Reroute Mechanism for Smart Sensors IoT and Network Infrastructure

A Survey of Fast Recovery Mechanisms in the Data Plane

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Contact Info

Product

Resources

About