@techreport{agv-rtgwg-spring-segment-routing-mrt-03,
    number =    {draft-agv-rtgwg-spring-segment-routing-mrt-03},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-agv-rtgwg-spring-segment-routing-mrt/03/},
    author =    {ANIL KUMAR S N and Gaurav Agrawal and Vinod KumarS and Chris Bowers},
    title =     {{Maximally Redundant Trees in Segment Routing}},
    pagetotal = 10,
    year =      2016,
    month =     aug,
    day =       29,
    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{]}.},
}