Evolution of IP Fast-Reroute Strategies

Kamisiński, Andrzej

doi:10.1109/rndm.2018.8489832

Cited by 23 publications

(19 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The interruption of operation caused by a network failure is therefore only for the time necessary to install a pre-prepared alternative route. This is considered as their undeniable advantage [ 25 ]. However, mechanisms in this category also have certain disadvantages identified.…”

Section: Related Workmentioning

confidence: 99%

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

Papán

Segeč

Yeremenko

et al. 2020

Sensors

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

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

Papán

Segeč

Yeremenko

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…There already exist many good surveys on reliable routing in specific communication technologies, such as Ethernet [34], IP [23], [25], [35], [36] (and more recently [23], [25]), MPLS [37], [38], BGP [39], or SDN [40]. However, to the best of our knowledge, this is the first complete and up-todate tutorial-like survey on the timely topic of fast-recovery mechanisms in the data plane.…”

Section: B Novelty and Target Audiencementioning

confidence: 99%

“…In FRR, the control plane is hence just responsible for pre-computing the failover paths; when a failure occurs, the data plane utilizes this additional state to forward packets. For example, many data centers use ECMP [22] (a data plane algorithm that provides automatic failover to another shortest path), WAN networks leverage IP Fast Reroute [23]- [25] or MPLS Fast Reroute [26] to deal with failures on the data plane, SDNs provide FRR functionality in terms of OpenFlow fast-failover groups [27], and BGP relies on BGP-PIC [28] for quickly rerouting flows, to just name a few.…”

Section: Introductionmentioning

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

“…Communication networks have become a critical infrastructure of our digital society: enterprises which outsource their IT infrastructure to the cloud, as well as many applications related to health monitoring, power grid management, or disaster response [1], depend on the uninterrupted availability of such networks. To meet their dependability requirements, most modern networks provide static Fast Rerouting (FRR) mechanisms [2], [3], [4], [5]. Since FRR mechanisms preconfigure conditional failover behaviors, they enable a very fast traffic recovery upon failures, which only involves the data plane but not the (typically much slower [6]) control plane.…”

Section: Introductionmentioning

confidence: 99%

Improved Fast Rerouting Using Postprocessing

Foerster

Kamisiński

Pignolet³

et al. 2022

IEEE Trans. Dependable and Secure Comput.

Self Cite

View full text Add to dashboard Cite

To provide fast traffic recovery upon failures, most modern networks support static Fast Rerouting (FRR) mechanisms for mission critical services. However, configuring FRR mechanisms to tolerate multiple failures poses challenging algorithmic problems. While state-of-the-art solutions leveraging arc-disjoint arborescence-based network decompositions ensure that failover routes always reach their destinations eventually, even under multiple concurrent failures, these routes may be long and introduce unnecessary loads; moreover, they are tailored to worst-case failure scenarios. This paper presents an algorithmic framework for improving a given FRR network decomposition, using postprocessing. In particular, our framework is based on iterative arc swapping strategies and supports a number of use cases, from strengthening the resilience (e.g., in the presence of shared risk link groups) to improving the quality of the resulting routes (e.g., reducing route lengths and induced loads). Our simulations show that postprocessing is indeed beneficial in various scenarios, and can therefore enhance today's approaches.

show abstract

Evolution of IP Fast-Reroute Strategies

Cited by 23 publications

References 52 publications

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

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

A Survey of Fast Recovery Mechanisms in the Data Plane

Improved Fast Rerouting Using Postprocessing

Contact Info

Product

Resources

About