Maximally Redundant Trees in Segment Routing
draft-agv-rtgwg-spring-segment-routing-mrt-03

Document Type Expired Internet-Draft (individual)
Last updated 2017-03-02 (latest revision 2016-08-29)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-agv-rtgwg-spring-segment-routing-mrt-03.txt

Abstract

[RFC7812] defines an architecture for IP/LDP Fast Reroute using Maximally Redundant Trees (MRT-FRR). This document extends the use of MRT to provide link and node protection for networks that use segment routing. This document makes use of the inherent support in segment routing for associating segments with different algorithms for computing next hops to reach prefixes. It assigns new Segment Routing Algorithms values corresponding to the MRT-Red and MRT-Blue next-hop computations defined in [RFC7811].

Authors

N Anil (anil.ietf@gmail.com)
Gaurav Agrawal (gaurav.agrawal@huawei.com)
Vinod KumarS (vinods.kumar@huawei.com)
Chris Bowers (cbowers@juniper.net)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)