< draft-ietf-mpls-ldp-mrt-00.txt   draft-ietf-mpls-ldp-mrt-01.txt >
MPLS Working Group A. Atlas MPLS Working Group A. Atlas
Internet-Draft K. Tiruveedhula Internet-Draft K. Tiruveedhula
Intended status: Standards Track C. Bowers Intended status: Standards Track C. Bowers
Expires: July 13, 2015 Juniper Networks Expires: January 5, 2016 Juniper Networks
J. Tantsura J. Tantsura
Ericsson Ericsson
IJ. Wijnands IJ. Wijnands
Cisco Systems, Inc. Cisco Systems, Inc.
January 9, 2015 July 4, 2015
LDP Extensions to Support Maximally Redundant Trees LDP Extensions to Support Maximally Redundant Trees
draft-ietf-mpls-ldp-mrt-00 draft-ietf-mpls-ldp-mrt-01
Abstract Abstract
This document specifies extensions to the Label Distribution This document specifies extensions to the Label Distribution
Protocol(LDP) to support the creation of label-switched paths for Protocol(LDP) to support the creation of label-switched paths for
Maximally Redundant Trees (MRT). A prime use of MRTs is for unicast Maximally Redundant Trees (MRT). A prime use of MRTs is for unicast
and multicast IP/LDP Fast-Reroute, which we will refer to as MRT-FRR. and multicast IP/LDP Fast-Reroute, which we will refer to as MRT-FRR.
The sole protocol extension to LDP is simply the ability to advertise The sole protocol extension to LDP is simply the ability to advertise
an MRT Capability. This document describes that extension and the an MRT Capability. This document describes that extension and the
skipping to change at page 1, line 47 skipping to change at page 1, line 47
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on July 13, 2015. This Internet-Draft will expire on January 5, 2016.
Copyright Notice Copyright Notice
Copyright (c) 2015 IETF Trust and the persons identified as the Copyright (c) 2015 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 3, line 19 skipping to change at page 3, line 19
LDP Fast-Reroute can use MRTs [I-D.ietf-rtgwg-mrt-frr-architecture]. LDP Fast-Reroute can use MRTs [I-D.ietf-rtgwg-mrt-frr-architecture].
It is necessary to be familiar with the architecture in It is necessary to be familiar with the architecture in
[I-D.ietf-rtgwg-mrt-frr-architecture] to understand how and why the [I-D.ietf-rtgwg-mrt-frr-architecture] to understand how and why the
LDP extensions for behavior are needed. LDP extensions for behavior are needed.
At least one common standardized algorithm (e.g. the MRT Lowpoint At least one common standardized algorithm (e.g. the MRT Lowpoint
algorithm explained and fully documented in algorithm explained and fully documented in
[I-D.ietf-rtgwg-mrt-frr-algorithm]) is required so that the routers [I-D.ietf-rtgwg-mrt-frr-algorithm]) is required so that the routers
supporting MRT computation consistently compute the same MRTs. LDP supporting MRT computation consistently compute the same MRTs. LDP
depends on an IGP for computation of MRTs and alternates. Extensions depends on an IGP for computation of MRTs and alternates. Extensions
to OSPF are defined in [I-D.atlas-ospf-mrt]. Extension to IS-IS are to OSPF are defined in [I-D.ietf-ospf-mrt]. Extension to IS-IS are
defined in [I-D.li-isis-mrt]. defined in [I-D.ietf-isis-mrt].
MRT can also be used to protect multicast traffic (signalled via PIM MRT can also be used to protect multicast traffic (signalled via PIM
or mLDP) using either global protection or local protection or mLDP) using either global protection or local protection
[I-D.atlas-rtgwg-mrt-mc-arch]. An MRT path can be used to provide [I-D.atlas-rtgwg-mrt-mc-arch]. An MRT path can be used to provide
node-protection for mLDP traffic via the mechanisms described in node-protection for mLDP traffic via the mechanisms described in
[I-D.wijnands-mpls-mldp-node-protection]; an MRT path can also be [I-D.wijnands-mpls-mldp-node-protection]; an MRT path can also be
used to provide link protection for mLDP traffic. used to provide link protection for mLDP traffic.
For each destination, IP/LDP Fast-Reroute with MRT (MRT-FRR) creates For each destination, IP/LDP Fast-Reroute with MRT (MRT-FRR) creates
two alternate destination-based trees separate from the shortest path two alternate destination-based trees separate from the shortest path
skipping to change at page 3, line 42 skipping to change at page 3, line 42
extensions [RFC7307] to signal Forwarding Equivalency Classes (FECs) extensions [RFC7307] to signal Forwarding Equivalency Classes (FECs)
for these two sets of forwarding trees, MRT-Blue and MRT-Red. for these two sets of forwarding trees, MRT-Blue and MRT-Red.
In order to create MRT paths and support IP/LDP Fast-Reroute, a new In order to create MRT paths and support IP/LDP Fast-Reroute, a new
capability extension is needed for LDP. An LDP implementation capability extension is needed for LDP. An LDP implementation
supporting MRT MUST also follow the rules described here for supporting MRT MUST also follow the rules described here for
originating and managing FECs related to MRT, as indicated by their originating and managing FECs related to MRT, as indicated by their
multi-topology ID. Network reconvergence is described in multi-topology ID. Network reconvergence is described in
[I-D.ietf-rtgwg-mrt-frr-architecture] and the worst-case network [I-D.ietf-rtgwg-mrt-frr-architecture] and the worst-case network
convergence time can be flooded via the extension in Section 7 of convergence time can be flooded via the extension in Section 7 of
[I-D.atlas-ospf-mrt]. [I-D.ietf-ospf-mrt].
IP/LDP Fast-Reroute using MRTs can provide 100% coverage for link and IP/LDP Fast-Reroute using MRTs can provide 100% coverage for link and
node failures in an arbitrary network topology where the failure node failures in an arbitrary network topology where the failure
doesn't partition the network. It can also be deployed doesn't partition the network. It can also be deployed
incrementally; an MRT Island is formed of connected supporting incrementally; an MRT Island is formed of connected supporting
routers and the MRTs are computed inside that island. routers and the MRTs are computed inside that island.
2. Requirements Language 2. Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
skipping to change at page 14, line 26 skipping to change at page 14, line 26
Value Description Reference Notes / Reg. Date Value Description Reference Notes / Reg. Date
------------- ------------------ ------------ ----------------- ------------- ------------------ ------------ -----------------
TBA-MRT-LDP-1 MRT Capability TLV [This draft] TBA-MRT-LDP-1 MRT Capability TLV [This draft]
IANA is requested to allocate a value for the new LDP Status Code IANA is requested to allocate a value for the new LDP Status Code
(the first free value in the range 0x00000032-0x00000036) from the (the first free value in the range 0x00000032-0x00000036) from the
LDP registry "Status Code Name Space": "MRT Capability negotiated LDP registry "Status Code Name Space": "MRT Capability negotiated
without MT Capability" (TBA-MRT-LDP-3). without MT Capability" (TBA-MRT-LDP-3).
Value E Description Reference Notes / Reg. Date Value E Description Reference Notes / Reg. Date
TBA-MRT-LDP-3 0 MRT Capability negotiated [This draft] ------------- - ------------------ ------------ -----------------
without MT Capability TBA-MRT-LDP-3 0 MRT Capability [This draft]
negotiated without
MT Capability
IANA is requested to allocate a value from the MPLS Multi-Topology IANA is requested to allocate a value from the MPLS Multi-Topology
Identifiers Name Space [RFC7307]: Rainbow MRT MT-ID (TBA-MRT-LDP-2). Identifiers Name Space [RFC7307]: Rainbow MRT MT-ID (TBA-MRT-LDP-2).
Value Purpose Reference Value Purpose Reference
------------- ------------------ ------------ ------------- ------------------ ------------
TBA-MRT-LDP-2 Rainbow MRT MT-ID [This draft] TBA-MRT-LDP-2 Rainbow MRT MT-ID [This draft]
8. Acknowledgements 8. Acknowledgements
The authors would like to thank Ross Callon, Loa Andersson, Stewart The authors would like to thank Ross Callon, Loa Andersson, Stewart
Bryant, Mach Chen, and Greg Mirsky for their suggestions. Bryant, Mach Chen, and Greg Mirsky for their suggestions.
9. References 9. References
9.1. Normative References 9.1. Normative References
[I-D.ietf-rtgwg-mrt-frr-algorithm] [I-D.ietf-rtgwg-mrt-frr-algorithm]
Enyedi, G., Csaszar, A., Atlas, A., Bowers, C., and A. Envedi, G., Csaszar, A., Atlas, A., Bowers, C., and A.
Gopalan, "Algorithms for computing Maximally Redundant Gopalan, "Algorithms for computing Maximally Redundant
Trees for IP/LDP Fast-Reroute", draft-rtgwg-mrt-frr- Trees for IP/LDP Fast- Reroute", draft-ietf-rtgwg-mrt-frr-
algorithm-01 (work in progress), July 2014. algorithm-05 (work in progress), July 2015.
[I-D.ietf-rtgwg-mrt-frr-architecture] [I-D.ietf-rtgwg-mrt-frr-architecture]
Atlas, A., Kebler, R., Bowers, C., Enyedi, G., Csaszar, Atlas, A., Kebler, R., Bowers, C., Envedi, G., Csaszar,
A., Tantsura, J., Konstantynowicz, M., and R. White, "An A., Tantsura, J., and R. White, "An Architecture for IP/
Architecture for IP/LDP Fast-Reroute Using Maximally LDP Fast-Reroute Using Maximally Redundant Trees", draft-
Redundant Trees", draft-rtgwg-mrt-frr-architecture-04 ietf-rtgwg-mrt-frr-architecture-05 (work in progress),
(work in progress), July 2014. January 2015.
[RFC5036] Andersson, L., Minei, I., and B. Thomas, "LDP [RFC5036] Andersson, L., Minei, I., and B. Thomas, "LDP
Specification", RFC 5036, October 2007. Specification", RFC 5036, October 2007.
[RFC5561] Thomas, B., Raza, K., Aggarwal, S., Aggarwal, R., and JL. [RFC5561] Thomas, B., Raza, K., Aggarwal, S., Aggarwal, R., and JL.
Le Roux, "LDP Capabilities", RFC 5561, July 2009. Le Roux, "LDP Capabilities", RFC 5561, July 2009.
[RFC7307] Zhao, Q., Raza, K., Zhou, C., Fang, L., Li, L., and D. [RFC7307] Zhao, Q., Raza, K., Zhou, C., Fang, L., Li, L., and D.
King, "LDP Extensions for Multi-Topology", RFC 7307, July King, "LDP Extensions for Multi-Topology", RFC 7307, July
2014. 2014.
9.2. Informative References 9.2. Informative References
[I-D.atlas-ospf-mrt]
Atlas, A., Hegde, S., Bowers, C., and J. Tantsura, "OSPF
Extensions to Support Maximally Redundant Trees", draft-
atlas-ospf-mrt-02 (work in progress), July 2014.
[I-D.atlas-rtgwg-mrt-mc-arch] [I-D.atlas-rtgwg-mrt-mc-arch]
Atlas, A., Kebler, R., Wijnands, I., Csaszar, A., and G. Atlas, A., Kebler, R., Wijnands, I., Csaszar, A., and G.
Envedi, "An Architecture for Multicast Protection Using Envedi, "An Architecture for Multicast Protection Using
Maximally Redundant Trees", draft-atlas-rtgwg-mrt-mc- Maximally Redundant Trees", draft-atlas-rtgwg-mrt-mc-
arch-02 (work in progress), July 2013. arch-02 (work in progress), July 2013.
[I-D.li-isis-mrt] [I-D.ietf-isis-mrt]
Li, Z., Wu, N., Zhao, Q., Atlas, A., Bowers, C., and J. Li, Z., Wu, N., Zhao, Q., Atlas, A., Bowers, C., and J.
Tantsura, "Intermediate System to Intermediate System (IS- Tantsura, "Intermediate System to Intermediate System (IS-
IS) Extensions for Maximally Redundant Trees(MRT)", draft- IS) Extensions for Maximally Redundant Trees (MRT)",
li-isis-mrt-01 (work in progress), July 2014. draft-ietf-isis-mrt-00 (work in progress), February 2015.
[I-D.ietf-ospf-mrt]
Atlas, A., Hegde, S., Bowers, C., Tantsura, J., and Z. Li,
"OSPF Extensions to Support Maximally Redundant Trees",
draft-ietf-ospf-mrt-00 (work in progress), January 2015.
[I-D.wijnands-mpls-mldp-node-protection] [I-D.wijnands-mpls-mldp-node-protection]
Wijnands, I., Rosen, E., Raza, K., Tantsura, J., Atlas, Wijnands, I., Rosen, E., Raza, K., Tantsura, J., Atlas,
A., and Q. Zhao, "mLDP Node Protection", draft-wijnands- A., and Q. Zhao, "mLDP Node Protection", draft-wijnands-
mpls-mldp-node-protection-04 (work in progress), June mpls-mldp-node-protection-04 (work in progress), June
2013. 2013.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997. Requirement Levels", BCP 14, RFC 2119, March 1997.
 End of changes. 13 change blocks. 
26 lines changed or deleted 28 lines changed or added

This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/