Fast emergency paths schema to overcome transient link failures in ospf routing
Fernando Barreto, Emilio C. G. Wille, Luiz Nacamura Jr

TL;DR
This paper introduces FEP-S, a proactive fast rerouting schema for OSPF that reduces packet loss during transient link failures by providing shorter recovery paths, thus enhancing network reliability.
Contribution
The paper presents a novel proactive rerouting approach, FEP-S, that improves upon existing methods by offering shorter recovery paths and reducing packet loss during OSPF convergence.
Findings
FEP-S provides shorter recovery paths than existing rerouting methods.
FEP-S significantly reduces packet loss during transient link failures.
Experimental results confirm improved network reliability with FEP-S.
Abstract
A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to various seconds in order to converge. During this convergence period, packets might traverse a longer path or even a loop. An even worse transient behaviour is that packets are dropped even though destinations are reachable. In this context, this paper describes a proactive fast rerouting approach, named Fast Emergency Paths Schema (FEP-S), to overcome problems originating from transient link failures in OSPF routing. Extensive experiments were done using several network topologies with different dimensionality degrees. Results show that the recovery paths, obtained by FEPS, are shorter than those from other rerouting approaches and can improve the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
