Robustly disjoint paths with segment routing

Aubry, François; Vissicchio, Stefano; Bonaventure, Olivier; Deville, Yves

doi:10.1145/3281411.3281424

Cited by 23 publications

(30 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aubry et al [1] define the notion of robustly disjoint paths. They subsequently propose an optimization problem to find these paths with the help of SR. Their general approach is similar to the one presented in this paper, as they try to find SR paths that remain disjoint after IGP convergence in predefined failure cases.…”

Section: Related Workmentioning

confidence: 99%

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Schüller

Aschenbruck

Chimani

et al. 2021

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Traffic engineering is an important concept that allows Internet Service Providers (ISPs) to utilize their existing routing hardware more efficiently. One technology that can be used is Segment Routing (SR). In this paper, we address the use of SR to increase the resilience against failure scenarios. In addition, we develop solutions that are manageable and, thus, deployable in a tier 1 ISP network. We propose a post-convergence aware SR based optimization model. With it, we can proactively find a single SR configuration that is beneficial in all predefined failure scenarios, including single link failures, shared risk link group failures, and node failures. In addition to this usecase, we also extend the optimization model to include other important practical requirements such as keeping the number of SR tunnels to a minimum, avoiding arbitrary traffic splitting, or meeting latency bounds. We evaluate our approaches with recently measured data from a tier 1 ISP and show that we can improve over state of the art routing approaches.

show abstract

Section: Related Workmentioning

confidence: 99%

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Schüller

Aschenbruck

Chimani

et al. 2021

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Accordingly, many mechanisms have been developed to provide fast rerouting under failures entirely in the data plane, e.g., [23], [58], [59], [30], [26], [60], [61], [11], [62], [63]. FRR mechanisms are also included in MPLS networks [64], [4], IP networks [3] and Openflow [20]. Detecting port failures falls beyond the scope of this paper as it depends on specific hardware support.…”

Section: Related Workmentioning

confidence: 99%

Fast ReRoute on Programmable Switches

Chiesa

Sedar

Antichi

et al. 2021

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Highly dependable communication networks usually rely on some kind of Fast Re-Route (FRR) mechanism which allows to quickly re-route traffic upon failures, entirely in the data plane. This paper studies the design of FRR mechanisms for emerging reconfigurable switches. Our main contribution is an FRR primitive for programmable data planes, PURR, which provides low failover latency and high switch throughput, by avoiding packet recirculation. PURR tolerates multiple concurrent failures and comes with minimal memory requirements, ensuring compact forwarding tables, by unveiling an intriguing connection to classic "string theory" (i.e., stringology), and in particular, the shortest common supersequence problem. PURR is well-suited for high-speed match-action forwarding architectures (e.g., PISA) and supports the implementation of a broad variety of FRR mechanisms. Our simulations and prototype implementation (on an FPGA and a Tofino switch) show that PURR improves TCAM memory occupancy by a factor of 1.5x-10.8x compared to a naïve encoding when implementing state-of-the-art FRR mechanisms. PURR also improves the latency and throughput of datacenter traffic up to a factor of 2.8x-5.5x and 1.2x-2x, respectively, compared to approaches based on recirculating packets.

show abstract

“…Pereira et al [16] proposed a robust semi-oblivious method to meet the flow demands and ensure good network performance after link failures. In [17], the authors proposed an SR method to construct a pairs path to remain disjointed even after an input set of failures to be used for restoration. In [18], the authors initiated a systematic study of such local fast failover mechanisms, which not only provided connectivity guarantees even under multiple link failures but also accounted for the quality of the resulting failover routes for locality and congestion, and they proposed a method called CASA, which provides a high degree of robustness as well as a provable quality of fast rerouting.…”

Section: Network Failure Correctionmentioning

confidence: 99%

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

2021

View full text Add to dashboard Cite

Due to overlay technologies, service providers have a logical view of the underlay network and can optimize the experience quality without modifying the physical network. However, the cross-layer interaction inevitably causes network fluctuation due to their inconsistent optimization objectives. Aside from that, network failures that occur in both layers not only cause network performance degradation but also significantly increase the frequency of cross-layer interaction. These problems make the network fluctuate for a long time, reduce the network performance, and influence the user experience, especially for time-sensitive applications. In this paper, we design a cross-layer architecture in which the logical layer can satisfy the service function chain demands and maximize the user experience and physical layer so it can optimize the overall network performance. Our cross-layer architecture can make proactive corrections in both layers. Furthermore, we investigate the cross-layer interaction and design two strategies to eliminate fluctuations and make the network converge quickly.

show abstract

Robustly disjoint paths with segment routing

Cited by 23 publications

References 33 publications

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Fast ReRoute on Programmable Switches

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

Contact Info

Product

Resources

About