<?xml version="1.0" encoding="US-ASCII"?>
<!DOCTYPE rfc SYSTEM "rfc2629.dtd"[
<!ENTITY I-D.ietf-mpls-ldp-multi-topology SYSTEM "http://xml.resource.org/public/rfc/bibxml3/reference.I-D.ietf-mpls-ldp-multi-topology.xml">
<!ENTITY I-D.atlas-bryant-shand-lf-timers SYSTEM "http://xml.resource.org/public/rfc/bibxml3/reference.I-D.atlas-bryant-shand-lf-timers.xml">
]>
<?rfc toc="yes"?>
<?rfc tocompact="yes"?>
<?rfc tocdepth="3"?>
<?rfc tocindent="yes"?>
<?rfc symrefs="yes"?>
<?rfc sortrefs="yes"?>
<?rfc comments="yes"?>
<?rfc inline="yes"?>
<?rfc compact="yes"?>
<?rfc subcompact="no"?>
<rfc category="std" docName="draft-li-isis-mrt-01" ipr="trust200902">
  <front>
    <title abbrev="IS-IS Extensions for MRT">Intermediate System to
    Intermediate System (IS-IS) Extensions for Maximally Redundant Trees
    (MRT)</title>

    <author fullname="Zhenbin Li" initials="Z. " surname="Li">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Huawei Bld., No.156 Beiqing Rd.</street>
          <city>Beijing</city>
          <code>100095</code>
          <country>China</country>
        </postal>
        <email>lizhenbin@huawei.com</email>
      </address>
    </author>

    <author fullname="Nan Wu" initials="N. " surname="Wu">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Huawei Bld., No.156 Beiqing Rd.</street>
          <city>Beijing</city>
          <code>100095</code>
          <country>China</country>
        </postal>
        <email>eric.wu@huawei.com</email>
      </address>
    </author>

    <author fullname="Quintin Zhao" initials="Q." surname="Zhao">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>125 Nagog Technology Park</street>
          <city>Acton</city>
          <region>MA</region>
          <code>01719</code>
          <country>USA</country>
        </postal>
        <phone/>
        <facsimile/>
        <email/>
        <uri/>
      </address>
    </author>

    <author fullname="Alia Atlas" initials="A." surname="Atlas">
      <organization>Juniper Networks</organization>
      <address>
        <postal>
          <street>10 Technology Park Drive</street>
          <city>Westford</city>
          <region>MA</region>
          <code>01886</code>
          <country>USA</country>
        </postal>
        <email>akatlas@juniper.net</email>
      </address>
    </author>

    <author fullname="Chris Bowers" initials="C." surname="Bowers">
      <organization>Juniper Networks</organization>
      <address>
        <postal>
          <street>1194 N. Mathilda Ave.</street>
          <city>Sunnyvale</city>
          <region>CA</region>
          <code>94089</code>
          <country>USA</country>
        </postal>
        <email>cbowers@juniper.net</email>
      </address>
    </author>

    <author fullname="Jeff Tantsura" initials="J." surname="Tantsura">
      <organization>Ericsson</organization>
      <address>
        <postal>
          <street>300 Holger Way</street>
          <city>San Jose</city>
          <region>CA</region>
          <code>95134</code>
          <country>USA</country>
        </postal>
        <email>jeff.tantsura@ericsson.com</email>
      </address>
    </author>

    <date day="4" month="July" year="2014"/>

    <abstract>
      <t>This document describes necessary extensions to IS-IS to support the
      distributed computation of Maximally Redundant Trees (MRT). Some example
      uses of the MRTs include IP/LDP Fast-Reroute and global protection or
      live-live for multicast traffic. The extensions indicate what MRT
      profile(s) each router supports. Different MRT profiles can be defined
      to support different uses and to allow transition of capabilities. An
      extension is introduced to flood MRT-Ineligible links, due to
      administrative policy.</t>
    </abstract>
  </front>

  <middle>
    <section title="Introduction">
      <t>The IS-IS protocol is specified in [ISO10589], with extensions for
      supporting IPv4 and IPv6 specified in <xref target="RFC1195"/> and <xref
      target="RFC5308"/>. Each Intermediate System (IS) (router) advertises
      one or more IS-IS Link State Protocol Data Units (LSPs) with routing
      information. Each LSP is composed of a fixed header and a number of
      tuples, each consisting of a Type, a Length, and a Value. Such tuples
      are commonly known as TLVs, and are a good way of encoding information
      in a flexible and extensible format.</t>

      <t><xref target="I-D.ietf-rtgwg-mrt-frr-architecture"/> gives a complete
      solution for IP/LDP fast-reroute using Maximally Redundant Trees (MRT)
      to provide alternates. This document describes the necessary signaling
      extensions for supporting MRT-FRR used in IS-IS routing domain.</t>
    </section>

    <section title="Requirements Language">
      <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
      "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
      document are to be interpreted as described in <xref
      target="RFC2119"/>.</t>
    </section>

    <section title="Terminology">
      <t>Redundant Trees (RT): A pair of trees where the path from any node X
      to the root R along the first tree is node-disjoint with the path from
      the same node X to the root R along the second tree. These can be
      computed in 2-connected graphs.</t>

      <t>Maximally Redundant Trees (MRT): A pair of trees where the path from
      any node X to the root R along the first tree and the path from the same
      node X to the root R along the second tree share the minimum number of
      nodes and the minimum number of links. Each such shared node is a
      cut-vertex. Any shared links are cut-links. Any RT is an MRT but many
      MRTs are not RTs.</t>

      <t>MRT Island: From the computing router, the set of routers that
      support a particular MRT profile and are connected via MRT- eligible
      links.</t>

      <t>GADAG: Generalized Almost Directed Acyclic Graph - a graph which is
      the combination of the ADAGs of all blocks. Transforming a network graph
      into a GADAG is part of the MRT algorithm.</t>

      <t>MRT-Red: MRT-Red is used to describe one of the two MRTs; it is used
      to describe the associated forwarding topology and MT-ID. Specifically,
      MRT-Red is the decreasing MRT where links in the GADAG are taken in the
      direction from a higher topologically ordered node to a lower one.</t>

      <t>MRT-Blue: MRT-Blue is used to describe one of the two MRTs; it is
      used to describe the associated forwarding topology and MT-ID.
      Specifically, MRT-Blue is the increasing MRT where links in the GADAG
      are taken in the direction from a lower topologically ordered node to a
      higher one.</t>
    </section>

<section title="Using MRT with Multi-Topology IGP Routing">
<t>  Both IS-IS and OSPF have support for multi-topology routing (see  
<xref target="RFC5120"/> for ISIS and <xref target="RFC4915"/> for OSPF.)
In addition to the standard topology (identified by MT-ID=0), these 
extensions allow the IGP to identify particular links and nodes as participating
in additional topologies (identified by MT-ID!=0).  A given link can 
belong to several topologies and be assigned different metrics in each topology.
The IGP runs an independent SPF computation for each topology, finding 
independent shortest paths to prefixes in each topology.</t>

<t> It is straightforward to extend the MRT computations to multi-topology
IGP routing.  For each IGP topology identified by an IGP MT-ID, we need to
identify the node and links belonging to an MRT Island for that IGP MT-ID.
This process creates a graph for the MRT Island for that specific IGP MT-ID, 
which can then be used to compute the transit next-hops and alternate 
next-hops for MRT-Red and MRT-Blue for that specific IGP MT-ID.</t>

<t> We expect that initial implementation and deployments of MRT will be primarily
concerned with computing MRT-Red and Blue trees for the standard topology
(IGP MT-ID=0).  However, we have chosen to specify the IS-IS MRT extensions
to accommodate the computation of MRT-Red and MRT-Blue in a multi-topology IS-IS 
environment.  This comes at the expense of 2-6 octets per TLV for MT-ID values,
but it will allow for standards-based multi-topology aware MRT implementations
for ISIS without any future standards work.
</t>

<t> Using MRT in a multi-topology IGP environment does have one 
complication which should be discussed.  Forwarding LDP traffic over MRT 
paths in the standard IGP topology requires the use of labels bound to 
topology-scoped FECs to identify traffic on MRT-Red and Blue trees.
This is described in Section 6 of 
<xref target="I-D.ietf-rtgwg-mrt-frr-architecture"/>.  To facilitate this,
an MRT profile specifies IANA-assigned MRT-Red and MRT-Blue LDP MT-ID values, which
are then used by LDP to advertise labels for the MRT-Red and Blue forwarding topologies.
Note that the MRT-Red and MRT-Blue LDP MT-ID values assigned by IANA for a given MRT
profile correspond to the MRT-Red and Blue forwarding trees associated with
the standard IGP topology with IGP MT-ID=0.  For example, suppose that a future MRT 
profile X is assigned (hypothetical) MRT-Red 
and MRT-Blue LDP MT-ID values of 2001 and 2002.  
Then labels for shortest path forwarding trees 
associated with the standard IGP topology will be advertised 
using FECs with MT-ID=0, while the labels for the MRT-Red and Blue forwarding 
trees for profile X will be advertised using FECS with MT-ID=2001 and 2002, respectively.
In the absence of multi-topology IGP routing, all MT-IDs used by LDP for 
MRT are assigned by IANA, so there are no potential conflicts in LDP MT-ID usage.</t>

<t> When MRT is used together with multi-topology IGP routing, 
additional LDP MT-IDs need to be specified for carrying traffic on
the MRT-Red and Blue forwarding trees associated with the additional
IGP routing topologies.  Building on the previous example,
suppose that a network is configured
with an additional IGP routing topology using MT-ID=20, in 
addition to the standard topology with MT-ID=0.   The router advertises support 
for MRT with respect to MT-ID=20 with profile X, as well as support for MRT 
with respect to MT-ID=0 with profile X.  The MRT-Red and Blue LDP MT-IDs for 
MT-ID=0 with profile X are still inherited from profile X, as in the previous
example.   In order to use LDP to create the MRT-Red and Blue forwarding trees for the 
IGP topology with MT-ID=20, the router could, for example, advertise
MRT-Red and MRT-Blue LDP MT-ID values of 21 and 22 for IGP MT-ID=20 and profile X.  
This overrides the (hypothetical) IANA-assigned values MRT-Red 
and MRT-Blue LDP MT-ID values for profile X, but maintains all 
other properties of profile X.  Care must be taken to avoid 
advertising LDP MT-ID values that conflict with implicitly 
advertised IANA-assigned values LDP MT-ID.
</t>

<t> The semantics of the IS-IS MRT extensions in this document are designed to 
handle the most common case (MRT in the absence of multi-topology IGP routing) 
in a simple manner.  Setting the IGP MT-ID field as well as the MRT-Blue
and MRT-Red LDP MT-ID fields to 0 in the TLV and sub-TLVs in this 
document results in the desired behavior for the standard IGP topology.  
</t>


</section>
	
	
    <section title="Overview of IS-IS Signaling Extensions for MRT">
      <t>As stated in <xref target="I-D.ietf-rtgwg-mrt-frr-algorithm"/>, it
      is necessary for each MRT-Capable router to compute MRT next hops in a
      consistent fashion. This is achieved by using same MRT profile and
      selecting the unique root in a MRT Island which is connected by
      MRT-Eligible links. Each of these issues will be discussed in following
      sections separately.</t>

      <section title="Supporting MRT Profiles">
        <t>The contents and requirements of an MRT profile has been defined in
        <xref target="I-D.ietf-rtgwg-mrt-frr-architecture"/>. The parameters
        and behavioral rules contained in an MRT profile define one router's
        MRT capabilities. Based on common capabilities, one unified MRT Island
        is built.</t>

        <t>The MRT-Capable router MUST advertise its corresponding MRT
        profiles by IS-IS protocol extension within IS-IS routing domain. The
        capabilities of advertiser MUST conform to the profile it claimed
        completely, especially the MT-IDs, the algorithm and the corresponding
        forwarding mechanism. This advertisement MUST have level scope. One
        router MAY support multiple MRT profiles and it MUST advertise these
        profiles in corresponding IS-IS level. The MT- IDs used in one
        supported MRT Profile MUST NOT overlap with those MT- IDs used in a
        different supported MRT Profile.</t>

        <t>The default MRT Profile is defined in <xref
        target="I-D.ietf-rtgwg-mrt-frr-architecture"/>. Its behavior is
        intended to support IP/LDP unicast and multicast Fast-Reroute.
        MRT-Capable routers SHOULD support the default MRT profile.</t>
      </section>

      <section title="Electing GADAG Root">
        <t>As per <xref target="I-D.ietf-rtgwg-mrt-frr-algorithm"/>, a GADAG
        root MUST be selected for one MRT Island. An unique GADAG root in
        common-sense among MRT Island routers is a necessity to do MRT
        computation. Since the selection of the GADAG root can affect the
        alternates and the traffic through it, the selection rules give
        network operator a knob to control the alternates and the traffic
        inside the MRT Island. Relevant discussion for the relationship
        between GADAG root role and MRT Island alternates is out of the scope
        of this document.</t>

        <t>Each MRT-Capable router MUST advertise its priority for GADAG root
        selection. One router can only have one priority in the same MRT
        Island. It can have multiple priorities for different MRT Islands it
        supports. Routers that are marked as overloaded(<xref
        target="RFC3787"/>) are not qualified as candidate for root selection.</t>

<t>The GADAG Root Selection Policy (defined as part of an MRT profile)
may make use of the GADAG Root Selection
Priority value advertised in the MRT Profile in the IS-IS Router CAPABILITY TLV.
For example, the GADAG Root Selection Policy for the default 
MRT profile is the following: Among the routers in the
MRT Island and with the highest priority advertised, an implementation
MUST pick the router with the highest Router ID to be the GADAG
root.</t>

        <t>When the current root is out of service or new router with higher
        priority joined into the MRT Island, the GADAG root MUST be
        re-selected. A new MRT computation will be triggered because of such a
        topology change.</t>
      </section>

      <section title="Advertising MRT-Ineligible Links for MRT">
        <t>For certain administrative or management reason, some links may not
        be involved into MRT computation. In this scenario, MRT-Capable router
        MUST claim those MRT-Ineligible links are out of MRT Island scope. If
        such claim splits current MRT Island then MRT computation has to be
        done inside the modified MRT Island which the computing router belongs
        to.</t>
      </section>

      <section title="Triggering an MRT Computation">
        <t>A MRT Computation can be triggered through topology changes or MRT
        capability changes of any router in the MRT Island. It is always
        triggered for a given MRT Profile in the corresponding level. First,
        the associated MRT Island is determined. Then, the GADAG Root is
        selected. Finally, the actual MRT algorithm is run to compute the
        transit MRT-Red and MRT-Blue topologies. Additionally, the router MAY
        choose to compute MRT-FRR alternates or make other use of the MRT
        computation results.</t>

        <t>Prefixes can be attached and detached and have their associated
        MRT- Red and MRT-Blue next-hops computed without requiring a new MRT
        computation.</t>
      </section>
    </section>

    <section title="MRT Capability Advertisement">
      <t>MRT-Capable router MUST identify its MRT capabilities through IS-IS
      Link State Packet(LSP) in level scope.</t>

      <section title="Advertising MRT Capability in IS-IS LSP">
        <t>One new M-bit is introduced into TLV 229 to identify router is
        MRT-Capable. Structure of TLV 229 is stated in <xref
        target="RFC5120"/> as pictured below:</t>

        <t>TYPE: 229</t>

        <t>LENGTH: total length of the value field, it SHOULD be 2 times the
        number of MT components.</t>

        <t>VALUE: one or more 2-byte MT components, structured as follows:</t>

        <figure align="center">
          <artwork><![CDATA[                                    No. of Octets
+--------------------------------+
|O |A |M |R |        MT ID       |      2
+--------------------------------+]]></artwork>
        </figure>

        <t>Bit M identifies the originator is of MRT-Capable. The MRT-Blue and
        the MRT-Red alternates will be calculated for the MT identified by
        MT-ID.</t>

        <t>This M-bit MUST be set and checked in LSP fragment 0. A MRT-Capable
        router MUST advertise this TLV with M-bit set for corresponding MT.
        For instance, if M-bit is set for MT-ID #0, MRT alternates will be
        calculated for standard topology.</t>

        <t>If only M-bit is advertised for MRT-Capabilities without any other
        MRT information then the router is regarded as supporting default MRT
        profile with default GADAG root selection priority.</t>
      </section>

   <section title="MRT Profile sub-TLV in IS-IS Router CAPABILITY TLV">
        <t>A new MRT Profile sub-TLV is introduced into IS-IS Router
        CAPABILITY TLV<xref target="RFC4971"/> to advertise MRT capabilities.
        Since MRT is per level scope, the S-bit and D-bit of IS-IS Router
        CAPABILITY TLV MUST be set to zero. The structure of the MRT Profile sub-TLV is pictured as below:</t>

        <t>TYPE: TBA-MRT-ISIS-1 (To Be Allocated by IANA)</t>

        <t>LENGTH: 8</t>

        <t>VALUE:</t>

        <t>MT ID (2 octet with 4 bits reserved)</t>

        <t>Profile ID (1 octet)</t>

        <t>MRT-Red LDP MT-ID (2 octet)</t>

        <t>MRT-Blue LDP MT-ID (2 octet)</t>

        <figure align="center">
          <artwork><![CDATA[+--------------------------------+
|R |R |R |R |        MT ID       |      2
+----------------+---------------+
|   Profile ID   |                      1
+----------------+
| GADAG Priority |                      1
+----------------+---------------+
|      MRT-Red LDP MT-ID        |      2
+--------------------------------+
|      MRT-Blue LDP MT-ID         |      2
+--------------------------------+]]></artwork>
        </figure>

        <t>12-bit MT ID represents the base MT topology which MRT computation
        is based on. Profile ID represents the MRT profile this router
        supports and GADAG Root Selection Priority
		is the priority for root selection. The
        range of this priority is [0, 255] with 128 as the default value.
		The GADAG Root Selection Policy defined as part of a given MRT profile
		determine how the GADAG Root Selection Priority value is used.
		</t>

        <t>If the MRT-Blue LDP MT-ID is 0, then the value specified in the
        associated MRT Profile is assumed. If the MRT-Red LDP MT-ID is 0, then the
        value specified in the associated MRT profile is assumed. The MRT-Blue
        LDP MT-ID and MRT-Red LDP MT-ID MUST NOT be the reserved values for LDP
        MT-IDs (<xref target="I-D.ietf-mpls-ldp-multi-topology"/> ). 
		The value for MRT-Blue LDP MT-ID and
        MRT-Red LDP MT-ID MUST be different except for 0. As stated above, the
        MRT-Blue LDP MT-ID and MRT-Red LDP MT-ID MUST NOT overlap among profiles if
        multiple MRT-Profile sub-TLVs are advertised.</t>

        <t>This sub-TLV can occur multiple times if this router support
        multiple MRT profiles. This can happen during transition or to support
        multiple uses of MRT which prefer different profiles.</t>
      </section>

      <section title="MRT-Ineligible Links sub-TLV in IS-IS Router CAPABILITY TLV">
        <t>As a matter of policy, some links may not be available for the MRT
        computation, which can prevent alternates or traffic using these
        links. For instance, policy can be made to prevent fast-rerouted
        traffic from taking those links.</t>

        <t>For a link to be excluded from the MRT computation, it MUST be
        advertised as sub-TLV in IS-IS Router CAPABILITY TLV which is in level
        scope with S-bit and D-bit unset. The MRT-Ineligible Link sub-TLV is
        structured as below:</t>

        <t>TYPE: TBA-MRT-ISIS-2 (To Be Allocated by IANA)</t>

        <t>LENGTH: from 9 to 255 octets</t>

        <t>VALUE:</t>

        <t>MT ID (2 octet with 4 bits reserved)</t>

        <t>System ID and pseudo-node number (7 octet for each MRT-Ineligible
        Link)</t>

        <figure align="center">
          <artwork><![CDATA[                                    No. of Octets
+--------------------------------+
|R |R |R |R |        MT ID       |      2
+--------------------------------+
|System ID and pseudonode number |      7
+--------------------------------+
|         Default metric         |      3
+--------------------------------+                         
.                                .
.                                .
+--------------------------------+
|System ID and pseudonode number |      7
+--------------------------------+
|         Default metric         |      3
+--------------------------------+  ]]></artwork>
        </figure>

        <t>Each MRT-Ineligible Link is identified by neighbor's System ID and
        pseudo-node number and Default metric, same as IS Reachability TLV.
        This sub-TLV MAY occur multiple times if multiple links are
        ineligible.</t>
      </section>
    </section>
	
<section title="Controlled Convergence sub-TLV in IS-IS Router CAPABILITY TLV">
<t>Section 12.2 of <xref target ="I-D.ietf-rtgwg-mrt-frr-architecture"/>
describes the need to wait for a configured or advertised period 
after a network failure to insure that all routers are using their 
new SPTs.
Similarly, avoiding micro-forwarding loops during convergence <xref
target="RFC5715"/> requires determining the maximum among all routers
in the area of the worst-case route computation and FIB installation
time.  More details on the specific reasoning and need for flooding this value
are given in <xref target="I-D.atlas-bryant-shand-lf-timers"/>.</t>

<t>A new Controlled Convergence sub-TLV is introduced into the IS-IS Router
CAPABILITY TLV <xref target="RFC4971"/> to advertise 
the worst-case time for a router to compute and install 
all IS-IS routes in the level after a change to a stable network.
This advertisement has per level scope, so the S-bit and 
D-bit of IS-IS Router CAPABILITY TLV MUST be set to zero.
The advertisement is 
scoped by IGP MT-ID, allowing a router supporting multi-topology
IGP routing to advertise a different worst-case compute and 
install time for each IGP topology.  This make sense as the SPF
computations for each IGP topology are independent of
one another, and may have different worst-case compute and install 
times.</t>

<t>The structure of the Controlled Convergence sub-TLV is
shown below:</t>

<t>TYPE: TBA-MRT-ISIS-3 (To Be Allocated by IANA)</t>

<t>LENGTH: 3</t>

<t>VALUE:</t>

<t>MT ID (2 octet with 4 bits reserved)</t>

<t>FIB compute/install time (1 octet)</t>

        <figure align="center">
          <artwork><![CDATA[+--------------------------------+
|R |R |R |R |        MT ID       |      2
+----------------+---------------+
|FIB comp/in time|                      1
+----------------+]]></artwork>
        </figure>
		
<t>The FIB compute/install time is the worst-case time the router
may take to compute and install all IS-IS routes in the level
after a change to a stable network.  The value is
in milliseconds.</t>

<t>The FIB compute/install time value sent by a router SHOULD be an estimate taking 
into account network scale or real-time measurements, or both.  
Advertisements SHOULD be dampened to avoid frequent
communication of small changes in the FIB compute/install time.</t>

<t>A router receiving the Controlled Convergence sub-TLV SHOULD
estimate the network convergence time as the maximum of the 
FIB compute/install times advertised by the routers in a level,
including itself.  In order to account for routers that do not advertise
the Controlled Convergence sub-TLV, a router MAY use a locally configured 
minimum network convergence time as a lower bound on the computed
network convergence time.  A router MAY use a locally configured 
maximum network convergence time as an upper bound on the computed
network convergence time.
</t>

</section>
    <section title="Handling MRT Capability Sending and Receiving">
      <t>The M-bit which identifies router's MRT capability MUST be advertised
      in LSP fragment 0. Those MRT related sub-TLVs SHOULD be ignored when MRT
      Capability bit is unset. When changes in MRT capabilities are received,
      a MRT computation SHOULD be triggered but MAY be delayed for a while to
      allow reception of all MRT-related information.</t>

      <section title="Advertising MRT extension">
        <t>MRT sub-TLVs are encapsulated in the Router Capability TLV and
        advertised through LSP PDU for the level-wide. MRT sub-TLVs are
        optional. If one router does not support MRT, it MUST NOT advertise
        those sub-TLVs.</t>

        <t>Since the advertisement scope of the MRT sub-TLV is level-wide, the
        D-Bit and S-Bit of the Router Capability TLV MUST be set as 0 when it
        is advertised. If other sub-TLVs in the Router Capability TLV need
        different values for those two bits, there MUST be an independent
        Router Capability TLV for MRT sub-TLVs.</t>

        <t>When MRT related information is changed for the router or existing
        IS-IS LSP mechanisms are triggered for refreshing or updating, MRT
        sub-TLVs MUST be advertised if the router is MRT-Capable.</t>

        <t>For administrative policies or reasons, it may be 
		desirable to exclude certain links from the MRT computation. 
		MRT-Ineligible sub-TLV is used to advertise which 
		links should be excluded. Note that an interface advertised 
		as MRT-Ineligigle by a router is ineligible with 
		respect to all profiles advertised by that router.</t>
      </section>

      <section title="Parsing MRT extension">
        <t>MRT extension MUST NOT affect the peer setup and the routing
        calculation of the standard topology.</t>

        <t>MRT sub-TLVs SHOULD be validated like other sub-TLVs when received.
        MRT sub-TLVs SHOULD also be taken for the checksum calculation and
        authentication.</t>

        <t>If MT-ID conflict is found for MRT-Red or MRT-blue from multiple
        sub-TLVs then those associated sub-TLVs MUST be ignored.</t>

        <t>Links advertised in MRT-Ineligible sub-TLV MUST be precluded from
        MRT Computation. The removal of those links may change the computing
        router's MRT Island significantly.</t>
      </section>
    </section>

    <section title="Backwards Compatibility">
      <t>The M-bit for MRT capability, the MRT Profile sub-TLV and the MRT-
      Ineligible Link sub-TLV defined in this document SHOULD NOT introduce
      any interoperability issues. Routers that do not support these MRT
      extensions SHOULD silently ignore them. Alternates or traffic MUST NOT
      be affected in current IS-IS routing domain.</t>
    </section>
	
<section title="Implementation Status">
<t>
[RFC Editor: please remove this section prior to publication.]
</t>
<t>Please see <xref target="I-D.ietf-rtgwg-mrt-frr-architecture"/> for 
details on implementation status.</t>
</section>

    <section title="Security Considerations">
      <t>This IS-IS extension is not believed to introduce new security
      concerns.</t>
    </section>

    <section title="IANA Considerations">
	  
<t>Please allocate values for the following IS-IS Router CAPABILITY TLV Types
<xref target="RFC4971"/>:  MRT Profile sub-TLV (TBA-MRT-ISIS-1), 
MRT-Ineligible Link sub-TLV (TBA-MRT-ISIS-2), and
Controlled Convergence sub-TLV (TBA-MRT-ISIS-3).</t>

    </section>
  </middle>

  <back>
    <references title="Normative References">
	<reference anchor="I-D.ietf-rtgwg-mrt-frr-architecture">
      <front>
         <title>An Architecture for IP/LDP Fast-Reroute Using Maximally Redundant Trees</title>
         <author fullname="Alia K. Atlas" initials="A." surname="Atlas"/>
		 <author fullname="Robert Kebler" initials="R.K." surname="Kebler"/>
         <author fullname="Chris Bowers" initials="C." surname="Bowers"/>
		 <author fullname="G&aacute;bor S&aacute;ndor Enyedi" initials="G.S.E." surname="Enyedi"/>
		 <author fullname="Andr&aacute;s Cs&aacute;sz&aacute;r" initials="A.C." surname="Cs&aacute;sz&aacute;r"/>
		 <author fullname="Jeff Tantsura" initials="J." surname="Tantsura"/>
		 <author fullname="Maciek Konstantynowicz" initials="M.K." surname="Konstantynowicz"/>
		 <author fullname="Russ White" initials="R.W." surname="White"/>
         <date month="July" day="4" year="2014"/>
      </front>
      <seriesInfo name="Internet-Draft" value="draft-rtgwg-mrt-frr-architecture-04"/>
      <format type="TXT"
          target="http://www.ietf.org/internet-drafts/draft-rtgwg-mrt-frr-architecture-04.txt"/>
    </reference>

	<reference anchor="I-D.ietf-rtgwg-mrt-frr-algorithm">
      <front>
         <title>Algorithms for computing Maximally Redundant Trees for IP/LDP Fast-Reroute</title>
         <author fullname="G&aacute;bor S&aacute;ndor Enyedi" initials="G.S.E." surname="Enyedi"/>
         <author fullname="Andr&aacute;s Cs&aacute;sz&aacute;r" initials="A.C." surname="Cs&aacute;sz&aacute;r"/>
         <author fullname="Alia K. Atlas" initials="A." surname="Atlas"/>
         <author fullname="Chris Bowers" initials="C." surname="Bowers"/>
         <author fullname="Abishek Gopalan" initials="A.G." surname="Gopalan"/>
         <date month="July" day="4" year="2014"/>
      </front>
      <seriesInfo name="Internet-Draft" value="draft-rtgwg-mrt-frr-algorithm-01"/>
      <format type="TXT"
          target="http://www.ietf.org/internet-drafts/draft-rtgwg-mrt-frr-algorithm-01.txt"/>
    </reference>
	
	  &I-D.ietf-mpls-ldp-multi-topology;

      <?rfc include='reference.RFC.3137'?>

      <?rfc include='reference.RFC.3787'?>
    </references>

    <references title="Infomative References">
      <?rfc include='reference.RFC.1195'?>

      <?rfc include='reference.RFC.2119'?>
	  
	  <?rfc include='reference.RFC.4915'?>

      <?rfc include='reference.RFC.4971'?>
	  
	  <?rfc include='reference.RFC.5120'?>

      <?rfc include='reference.RFC.5308'?>
	  
	  <?rfc include='reference.RFC.5715'?>
	  
	  &I-D.atlas-bryant-shand-lf-timers;
    </references>
  </back>
</rfc>
