Optimization methods for improving IP-level fast protection for local shared risk groups with Loop-Free Alternates

Yeremenko

et al. 2020

Sensors

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.

Section: The Fast Reroutementioning

confidence: 99%

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

Yeremenko

et al. 2020

Sensors

“…The equal-cost multi-path (ECMP) [ 26 , 28 ] uses multiple routing paths that have the same metric in parallel. Multiple routing configurations (MRC) [ 28 , 30 , 31 ] uses different routing tables, while not-via addresses mechanisms [ 32 , 33 ] use specific addresses for explicit identification of failure. Furthermore, there are several FRR mechanisms exist based on alternative trees [ 19 , 34 , 35 ].…”

Section: Related Workmentioning

confidence: 99%

A New Bit Repair Fast Reroute Mechanism for Smart Sensors IoT Network Infrastructure

Yeremenko

et al. 2020

Sensors

Today’s IP networks are experiencing a high increase in used and connected Internet of Things (IoT) devices and related deployed critical services. This puts increased demands on the reliability of underlayer transport networks. Therefore, modern networks must meet specific qualitative and quantitative parameters to satisfy customer service demands in line with the most common requirements of network fault tolerance and minimal packet loss. After a router or link failure within the transport network, the network convergence process begins. This process can take an unpredictable amount of time, usually depending on the size, the design of the network and the routing protocol used. Several solutions have been developed to address these issues, where one of which is the group of so-called Fast ReRoute (FRR) mechanisms. A general feature of these mechanisms is the fact that the resilience to network connectivity failures is addressed by calculating a pre-prepared alternative path. The path serves as a backup in the event of a network failure. This paper presents a new Bit Repair (B-REP) FRR mechanism that uses a special BIER header field (Bit-String) to explicitly indicate an alternative path used to route the packet. B-REP calculates an alternative path in advance as a majority of existing FRR solutions. The advantage of B-REP is the ability to define an alternative hop-by-hop path with full repair coverage throughout the network, where, unlike other solutions, we propose the use of a standardized solution for this purpose. The area of the B-REP application is communication networks working on the principle of packet switching, which use some link-state routing protocol. Therefore, B-REP can be successfully used in the IoT solutions especially in the field of ensuring communication from sensors in order to guarantee a minimum packet loss during data transmission.

“…The efficiency of a particular IPFRR mechanism is defined by its repair coverage. If an IPFRR mechanism is able to repair all possible failures within a network, we will say it provides 100% repair coverage . Following the formal IPFRR terminology, we will use these specific labels to denote routers with a special responsibility: Router S (source router) – a router that has detected a connectivity failure with the primary next‐hop (also called the E Router) for a specific destination D, and then starts a local IPFRR repair. Router E (primary next‐hop) – a router that is the primary next‐hop from the router S toward the router D. Router D (destination router) – the destination router of the original flow that is being rerouted via an alternative backup path. Routers N1, N2, N3… – routers used as alternative backup next‐hops, as the source router S might have precomputed more than one alternative backup next‐hop. When the failure within a network occurs, the IPFRR mechanism causes traffic to be routed via an alternative precomputed backup path until the process of network convergence is completed (see Figure ).…”

Section: Ip Fast Reroutementioning

confidence: 99%

“…The RLFA router may be several hops away from the source router S. The RLFA mechanism can provide a higher repair coverage than the basic LFA, but at the cost of higher computational complexity . 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) .…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Concurrency and Computation

Palúch

et al. 2018

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.