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

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Authors Gaurav Agrawal  , N Anil  , Vinod KumarS 
Last updated 2016-04-14 (latest revision 2015-10-12)
Stream (None)
Formats
Expired & archived
pdf htmlized (tools) 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-01.txt

Abstract

This document presents a Fast Reroute (FRR) approach aimed at providing link and node protection of node and adjacency segments within the Segment Routing (SR) framework. This FRR behavior builds on Maximally Redundant Trees (MRT) FRR algorithm [I-D.atlas-rtgwg- mrt-mc-arch]. Fast-Reroute with Maximally Redundant Trees (MRT-FRR) using Segment routing is a technology that gives link-protection and node- protection with 100% coverage in any network topology that is still connected after the failure. MRT is computational efficient. For any router in the network, the MRT computation is less than the LFA computation for a node with three or more neighbors in SR domain (Ex: Topology Independent Fast Reroute).

Authors

Gaurav Agrawal (gaurav.agrawal@huawei.com)
N Anil (anil.sn@huawei.com)
Vinod KumarS (vinods.kumar@huawei.com)

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