--- 1/draft-ietf-mpls-p2mp-requirement-01.txt 2006-02-05 00:42:11.000000000 +0100 +++ 2/draft-ietf-mpls-p2mp-requirement-02.txt 2006-02-05 00:42:11.000000000 +0100 @@ -1,18 +1,18 @@ Network Working Group Seisho Yasukawa (NTT) Internet Draft Editor - -Expiration Date: June 2004 January 2004 +Category: Standards Track +Expiration Date: August 2004 March 2004 Requirements for Point to Multipoint extension to RSVP-TE - + Status of this Memo This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet- Drafts. @@ -23,99 +23,101 @@ material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. Abstract - This document presents a set of requirements for Point-to-Multipoint - (P2MP) Traffic Engineering (TE) extensions to Multiprotocol Label - Switching (MPLS). It specifies functional requirements for RSVP-TE in - order to deliver P2MP applications over a MPLS TE infrastructure. It - is intended that potential solutions, that specify RSVP-TE procedures - for P2MP TE LSP setup, use these requirements as a guideline. It is - not intended to specify solution specific details in this document. + This document presents a basic set of requirements for Point-to- + Multipoint(P2MP) Traffic Engineering (TE) extensions to Multiprotocol + Label Switching (MPLS). It specifies functional requirements for + RSVP-TE in order to deliver P2MP applications over a MPLS TE + infrastructure. It is intended that solutions that specify RSVP-TE + procedures for P2MP TE LSP setup satisfy these requirements. There is + no intent to specify solution specific details in this document. It is intended that the requirements presented in this document are not limited to the requirements of packet switched networks, but also encompass the requirements of L2SC, TDM, lambda and port switching networks managed by Generalized MPLS (GMPLS) protocols. Protocol solutions developed to meet the requirements set out in this document must be equally applicable to MPLS and GMPLS. Table of Contents 1. Introduction .................................................. 4 2. Definitions ................................................... 5 2.1 Acronyms .................................................. 5 2.2 Terminology ............................................... 5 - 2.3 Conventions ............................................... 6 + 2.3 Conventions ............................................... 7 3. Problem statements ............................................ 7 3.1 Motivation ................................................ 7 - 3.2 Requirements overview ..................................... 7 - 4. Application Specific Requirements ............................. 9 - 4.1 P2MP tunnel for IP multicast data ......................... 9 - 4.2 P2MP TE backbone network for IP multicast network .........10 - 4.3 Layer 2 Multicast Over MPLS ...............................11 - 4.4 VPN multicast network .....................................12 - 4.5 GMPLS network .............................................13 - 5. Detailed requirements for P2MP TE extensions ..................13 - 5.1 P2MP LSP tunnels ..........................................13 - 5.2 P2MP explicit routing .....................................14 - 5.3 Explicit Path Loose Hops and Widely Scoped Abstract Nodes .15 + 3.2 Requirements overview ..................................... 8 + 4. Application Specific Requirements .............................10 + 4.1 P2MP tunnel for IP multicast data .........................10 + 4.2 P2MP TE backbone network for IP multicast network .........11 + 4.3 Layer 2 Multicast Over MPLS ...............................12 + 4.4 VPN multicast network .....................................13 + 4.5 GMPLS network .............................................14 + 5. Detailed requirements for P2MP TE extensions ..................14 + 5.1 P2MP LSP tunnels ..........................................14 + 5.2 P2MP explicit routing .....................................15 + 5.3 Explicit Path Loose Hops and Widely Scoped Abstract Nodes .16 5.4 P2MP TE LSP establishment, teardown, and modification - mechanisms ................................................16 - 5.5 Failure Reporting and Error Recovery ......................16 - 5.6 Record route of P2MP TE LSP tunnels .......................17 + mechanisms ................................................17 + 5.5 Failure Reporting and Error Recovery ......................17 + 5.6 Record route of P2MP TE LSP tunnels .......................18 5.7 Call Admission Control (CAC) and QoS control mechanism of P2MP TE LSP tunnels ....................................18 - 5.8 Reoptimization of P2MP TE LSP .............................18 + 5.8 Reoptimization of P2MP TE LSP .............................19 5.9 IPv4/IPv6 support .........................................19 - 5.10 P2MP MPLS Label ..........................................19 - 5.11 Routing advertisement of P2MP capability .................19 - 5.12 Multi-Area/AS LSP ........................................19 - 5.13 P2MP MPLS management .....................................20 - 5.14 Scalability ..............................................20 - 5.15 Backwards Compatibility ..................................20 - 5.16 GMPLS ....................................................21 - 5.17 Requirements for Hierarchical P2MP TE LSPs ...............21 - 5.18 P2MP Crankback routing ...................................22 - 6. Security Considerations........................................22 - 7. Acknowledgements ..............................................22 - 8. References ....................................................22 - 8.1 Normative References ......................................22 - 8.2 Informational References ..................................23 - 9. Author's Addresses ............................................24 - 10. Intellectual Property Consideration ...........................26 - 11. Full Copyright Statement ......................................26 + 5.10 P2MP MPLS Label ..........................................20 + 5.11 Routing advertisement of P2MP capability .................20 + 5.12 Multi-Area/AS LSP ........................................20 + 5.13 P2MP MPLS OAM ............................................20 + 5.14 Scalability ..............................................21 + 5.15 Backwards Compatibility ..................................21 + 5.16 GMPLS ....................................................22 + 5.17 Requirements for Hierarchical P2MP TE LSPs ...............22 + 5.18 P2MP Crankback routing ...................................23 + 6. Security Considerations........................................23 + 7. Acknowledgements ..............................................23 + 8. References ....................................................23 + 8.1 Normative References ......................................23 + 8.2 Informational References ..................................24 + 9. Editor's Address ..............................................26 + 10. Authors' Addresses ............................................26 + 11. Intellectual Property Consideration ...........................27 + 11.1 IPR Disclosure Acknowledgement ...........................28 + 12. Full Copyright Statement ......................................28 1. Introduction Existing MPLS Traffic Engineering (MPLS-TE) allows for strict QoS - guarantees, resources optimization, and fast failure recovery but is + guarantees, resources optimization, and fast failure recovery, but is limited to P2P applications. There are P2MP applications like Content Distribution, Interactive Multimedia and VPN multicast that would - also benefit from these TE capabilities. This clearly motivates for - enhancement of base MPLS-TE tool box in order to support P2MP + also benefit from these TE capabilities. This clearly motivates + enhancements of the base MPLS-TE tool box in order to support P2MP applications. This document presents a set of requirements for Point-to-Multipoint (P2MP) Traffic Engineering (TE) extensions to Multiprotocol Label Switching (MPLS). It specifies functional requirements for RSVP-TE [RFC3209] in order to deliver P2MP applications over a MPLS TE. - It is intended that potential solutions, that specify RSVP-TE - procedures for P2MP TE LSP setup, use these requirements as a - guideline. It is not intended to specify solution specific details + It is intended that solutions, that specify RSVP-TE + procedures and extensions for P2MP TE LSP setup, satisfy these + requirements. It is not intended to specify solution specific details in this document. It is intended that the requirements presented in this document are not limited to the requirements of packet switched networks, but also encompass the requirements of TDM, lambda and port switching networks managed by Generalized MPLS (GMPLS) protocols. Protocol solutions developed to meet the requirements set out in this document must be equally applicable to MPLS and GMPLS. Content Distribution (CD), Interactive multi-media (IMM), and VPN @@ -129,36 +131,37 @@ bandwidth resources, memory and MPLS (e.g. label) resources in the network. Hence, to provide TE for a P2MP application in an efficient manner in a large-scale environment, P2MP TE mechanisms are required specifically to support P2MP TE LSPs. Existing MPLS TE mechanisms [RFC3209] do not support P2MP TE LSPs so new mechanisms must be developed. This should be achieved without running a multicast routing protocol - in the network core and with maximum re-use of the existing MPLS - protocols in particular MPLS Traffic Engineering. + in the network core, and with maximum re-use of the existing MPLS + protocols: in particular, MPLS Traffic Engineering. A P2MP TE LSP will be set up with TE constraints and will allow - efficient packet replication at various branching points in the - network. RSVP-TE will be used for setting up a P2MP TE LSP with + efficient packet or data replication at various branching points in + the network. RSVP-TE will be used for setting up a P2MP TE LSP with enhancements to existing P2P TE LSP procedures. The P2MP TE LSP setup mechanism will include the ability to add/remove receivers to/from an existing P2MP TE LSP. - Moreover, multicast traffic cannot currently benefit from P2P TE LSP. - Hence, CAC for P2P TE LSP cannot take into account the bandwidth used - for multicast traffic. P2MP TE will allow to count the bandwidth used - by unicast and multicast traffic by means of CAC. + Moreover, multicast traffic cannot currently benefit from P2P TE + LSPs. Hence, CAC for P2P TE LSP cannot take into account the + bandwidth used for multicast traffic. P2MP TE will allow the + bandwidth used by unicast and multicast traffic to be counted by + means of CAC. - The problem statement is discussed in the following section. This + The problem statement is discussed in Section 3. This document discusses various applications that can use P2MP TE LSP. Detailed requirements for the setup of a P2MP MPLS TE LSP using RSVP-TE are described. Application specific requirements are also described. 2. Definitions 2.1 Acronyms @@ -174,35 +177,32 @@ The reader is assumed to be familiar with the terminology in [RFC3031] and [RFC3209]. P2MP TE LSP: A traffic engineered label switched path that has one unique ingress LSR (also referred to as the root) and more than one egress LSR (also referred to as the leaf). - P2MP path: + P2MP tree: The ordered set of LSRs and links that comprise the path of a P2MP TE LSP from its ingress LSR to all of its egress LSRs. - This path may be viewed as a tree. - - sub-P2MP path: + sub-P2MP tree: - A sub-P2MP path is a portion of a P2MP path starting at - a particular LSR that is a member of the P2MP path and includes - ALL downstream LSRs that are also members of the P2MP path. - A sub-P2MP path may be viewed as a sub-tree. + A sub-P2MP tree is a portion of a P2MP tree starting at + a particular LSR that is a member of the P2MP tree and includes + ALL downstream LSRs that are also members of the P2MP tree. - P2P sub-LSP path: + P2P sub-LSP: The path from the ingress LSR to a particular egress LSR. ingress LSR: The LSR that is responsible for initiating the signaling messages that set up the P2MP TE LSP. egress LSR: @@ -213,33 +213,38 @@ An LSR that is an egress, but also has one or more directly connected downstream LSRs. branch LSR: An LSR that has more than one directly connected downstream LSR. graft LSR: - An LSR that is already a member of the P2MP path and is in - process of signaling a new sub-P2MP path. + An LSR that is already a member of the P2MP tree and is in + process of signaling a new sub-P2MP tree. prune LSR: - An LSR that is already a member of the P2MP path and is in - process of tearing down an existing sub-P2MP path. + An LSR that is already a member of the P2MP tree and is in + process of tearing down an existing sub-P2MP tree. + + P2MP-ID (Pid): + + The ID that can be used to map a set of P2P sub- LSPs to a + particular P2MP LSP. 2.3 Conventions 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 RFC2119 [5]. + document are to be interpreted as described in [RFC2119]. 3. Problem Statement 3.1 Motivation Content Distribution (CD), Interactive multi-media (IMM), and VPN multicast are applications that are best supported with multicast capabilities. IP Multicast provides P2MP communication. However, there are no @@ -267,107 +272,111 @@ characteristics. It also wastes bandwidth resources, memory and MPLS (e.g. label) resources in the network. Hence, to provide MPLS TE [RFC2702] for a P2MP application in an efficient manner in a large scale environment, P2MP TE mechanisms are required. Existing MPLS P2P TE mechanisms have to be enhanced to support P2MP TE LSP. 3.2. Requirements Overview - This document is proposing requirements for the setup of P2MP TE + This document states basic requirements for the setup of P2MP TE LSPs. This should be achieved without running a multicast routing protocol in the network core and with maximum re-use of the existing MPLS protocols. Note that the use of MPLS forwarding to carry the multicast traffic may also be useful in the context of some network design where it is being desired to avoid running some multicast routing protocol like PIM [PIM-SM] or BGP (which might be required for the use of PIM). A P2MP LSP will be set up with TE constraints and will allow efficient MPLS packet replication at various branching points in the network. RSVP-TE will be used for setting up a P2MP TE LSP with enhancements to existing P2P TE LSP procedures. The P2MP TE LSP setup mechanism will include the ability to add/remove egress LSRs to/from an existing P2MP TE LSP and should support all the TE LSP management procedures defined for P2P TE LSP (like the non disruptive rerouting - the so called "Make before break" procedure). - The computation of P2MP TE paths is implementation dependent and is + The computation of P2MP TE trees is implementation dependent and is beyond the scope of the solutions that are built with this document as a guideline. - The MPLS WG will specify how to build P2MP TE LSPs. The usage of - those solutions will be application dependent and is out of the scope - of this draft. However, it is a requirement that those solutions be - applicable to GMPLS as well as MPLS so that only a single set of - solutions are developed. + A separate document(s) will specify how to build P2MP TE LSPs. The + usage of those solutions will be application dependent and is out of + the scope of this document. However, it is a requirement that those + solutions be applicable to GMPLS as well as to MPLS so that only a + single set of solutions are developed. Consider the following figure. Source 1 (S1) | I-LSR1 | | | | R2----E-LSR3--LSR1 LSR2---E-LSR2--Receiver 1 (R1) | : R3----E-LSR4 E-LSR5 | : | : R4 R5 Figure 1 - The figure above shows a single ingress (I-LSR1), and four egresses + Figure 1 shows a single ingress (I-LSR1), and four egresses (E-LSR2, E-LSR3, E-LSR4 and E-LSR5). I-LSR1 is attached to a traffic source that is generating traffic for a P2MP application. - Receivers:R1, R2, R3 and R4 are attached to E-LSR2, E-LSR3 and + Receivers R1, R2, R3 and R4 are attached to E-LSR2, E-LSR3 and E-LSR4. - The following are the objectives that we wish to achieve: + The following are the objectives of P2MP LSP establishment and use. - a) A P2MP TE LSP path which satisfies various - constrains is pre-determined and supplied to ingress I-LSR1. + a) A P2MP TE LSP tree which satisfies various constraints is pre- + determined and supplied to ingress I-LSR1. - Note that no assumption is made on whether the path is provided + Note that no assumption is made on whether the tree is provided to I-LSR1 or computed by I-LSR1. Typical constraints are bandwidth requirements, resource class affinities, fast rerouting, preemption. There should not be any restriction on the possibility to support the set of - constraints already defined for point to point TE LSPs. + constraints already defined for point to point TE LSPs. A new + constraint may specify which LSRs should be used as branch + points for the P2MP LSR in order to take into account some LSR + capabilities or network constraints. b) A P2MP TE LSP is set up by means of RSVP-TE from I-LSR1 to - E-LSR2, E-LSR3 and E-LSR4 using the path information. + E-LSR2, E-LSR3 and E-LSR4 using the tree information. c) In this case, the branch LSR1 should replicate incoming packets - and send them to E-LSR3 and E-LSR4. + or data and send them to E-LSR3 and E-LSR4. d) If a new receiver (R5) expresses an interest in receiving - traffic, a new path is determined and a sub-P2MP path from - LSR2 to E-LSR5 is grafted onto the P2MP path. LSR2 becomes + traffic, a new tree is determined and a sub-P2MP tree from + LSR2 to E-LSR5 is grafted onto the P2MP tree. LSR2 becomes a branch LSR. 4. Application Specific Requirements This section describes some of the applications that P2MP MPLS TE is applicable to along with application specific requirements. The purpose of this section is not to mandate how P2MP TE LSPs must be used in certain application scenarios. Rather it is to illustrate some of the potential application scenarios so as to highlight the features and functions that any P2MP solution must provide in order to be of wide use and applicability. This section is not meant - to be exhaustive and not limited to the described applications. + to be exhaustive, and P2MP is not limited to the described + applications. 4.1 P2MP TE LSP for IP multicast data One typical scenario is to use P2MP TE LSPs as P2MP tunnels carrying multicast data traffic (e.g. IP mcast). In this scenario, a P2MP TE LSP is established between an ingress LSR which supports IP multicast source and several egress LSRs which support several IP multicast receivers. Instead of using an IP multicast routing protocol in the network core, a P2MP TE LSP is established over the network and IP multicast data are tunneled from an ingress LSR @@ -487,21 +497,21 @@ 4.4 VPN multicast network In this scenario, P2MP TE LSPs are utilized to construct a provider network which can deliver VPN multicast service(s) to its customers. A P2MP TE LSP is established between all the PE routers which accommodate the customer private network(s) that handle the IP multicast packets. Each PE router must handle a VPN instance. For example, in Layer3 VPNs like BGP/MPLS based IP VPNs - [BGP/MPLS IP VPNs], this means that each PE router must handle both + [BGPMPLS-VPN], this means that each PE router must handle both private multicast VRF tables and common multicast routing and forwarding table. And each PE router exchanges private multicast routing information between the corresponding PE routers. It is desirable that P2MP MPLS TE can be used for Layer3 VPN data transmission. Another example is a Layer2 VPN that supports multipoint LAN connectivity service. In an Ethernet network environment, IP multicast data is flooded to the appropriate Ethernet port(s). @@ -539,549 +549,588 @@ to use P2MP features. Therefore, it is a requirement that all the features/mechanisms (and protocol extensions) that will be defined to provide MPLS P2MP TE LSPs will be equally applicable to P2MP PSC and non-PSC TE-LSPs. 5. Detailed requirements for P2MP TE extensions 5.1 P2MP LSP tunnels The P2MP RSVP-TE extensions MUST be applicable to signaling LSPs - of different traffic types. For example, it must be possible to + of different traffic types. For example, it MUST be possible to signal a P2MP TE LSP to carry any kind of payload being packet or non-packet based (including frame, cell, TDM un/structured, etc.) Carrying IP multicast or Ethernet traffic within a P2MP tunnel are typical examples. - As with P2P MPLS technology [RFC3031], traffic is classified with + As with P2P MPLS technology [RFC3031], traffic is classified with a FEC in this extension. All packets which belong to a particular FEC and which travel from a particular node MUST follow the same P2MP - path. + tree. - In order to scale to a large number of branches, P2MP TE LSPs should - be identified by unique identifier that is constant for the whole LSP - regardless of the number of branches and/or leaves. Therefore, the - identification of the P2MP session by its destination addresses is - not adequate. + In order to scale to a large number of branches, P2MP TE LSPs SHOULD + be identified by a unique identifier (the P2MP ID or Pid) that is + constant for the whole LSP regardless of the number of branches + and/or leaves. Therefore, the identification of the P2MP session by + its destination addresses is not adequate. 5.2 P2MP explicit routing - Various optimizations in P2MP path formation need to be applied to + Various optimizations in P2MP tree formation need to be applied to meet various QoS requirements and operational constraints. - Some P2MP applications may request a bandwidth guaranteed P2MP path + + Some P2MP applications may request a bandwidth guaranteed P2MP tree which satisfies end-to-end delay requirements. And some operators - may want to set up a cost minimum P2MP path by specifying branch LSRs + may want to set up a cost minimum P2MP tree by specifying branch LSRs explicitly. The P2MP TE solution therefore MUST provide a means of establishing - arbitrary P2MP paths under the control of an external path - computation process or path configuration process or dynamic path + arbitrary P2MP trees under the control of an external tree + computation process or path configuration process or dynamic tree computation process located on the ingress LSR. Figure 4 shows two typical examples. A A | / \ B B C | / \ / \ C D E F G | / \ / \/ \ / \ D--E*-F*-G*-H*-I*-J*-K*--L H I J KL M N O - Steiner P2MP path SPF P2MP path + Steiner P2MP tree SPF P2MP tree Figure 4 Examples of P2MP TE LSP topology - One example is Steiner[STEINER] P2MP path (Cost minimum P2MP path). - This P2MP path is suitable for constructing cost minimum P2MP path. - To realize this P2MP path, several intermediate LSRs must be both - MPLS data terminating LSR and transit LSR (LSR E, F, G, H, I, J, K, - in the figure 4). This means that the LSR must perform both label - swapping and popping at the same time. Therefore, the P2MP TE - solution MUST support a mechanism that can setup this kind of + One example is the Steiner P2MP tree (Cost minimum P2MP tree) + [STEINER]. This P2MP tree is suitable for constructing a cost minimum + P2MP tree. To realize this P2MP tree, several intermediate LSRs must + be both MPLS data terminating LSRs and transit LSRs (LSRs E, F, G, H, + I, J and K in the figure 4). This means that the LSRs must perform + both label swapping and popping at the same time. Therefore, the P2MP + TE solution MUST support a mechanism that can setup this kind of bud LSR between an ingress LSR and egress LSRs. - Another example is CSPF (Constraint Shortest Path Fast) P2MP path. By - some metric (which can be set upon any specific criteria like the + Another example is a CSPF (Constraint Shortest Path Fast) P2MP tree. + By some metric (which can be set upon any specific criteria like the delay, bandwidth, a combination of those), one can calculate a cost - minimum P2MP path. This P2MP path is suitable for carrying real time + minimum P2MP tree. This P2MP tree is suitable for carrying real time traffic. - To support explicit setup of any reasonable P2MP path shape, a P2MP + To support explicit setup of any reasonable P2MP tree shape, a P2MP TE solution MUST support some form of explicit source-based control - of the P2MP path which can explicitly include particular LSRs as + of the P2MP tree which can explicitly include particular LSRs as branch nodes. This can be used by the ingress LSR to setup the P2MP - TE LSP. Being implementation specific (more precisely dependent of + TE LSP. Being implementation specific (more precisely dependent on the data structure specific representation and its processing), the detailed method for controlling the P2MP TE LSP topology depends on how the control plane represents the P2MP TE LSP data plane entity. For instance, a P2MP TE LSP can be simply represented as a whole tree or by its individual branches. - Here also, effectiveness of the potential solutions is left outside + Here the effectiveness of the potential solutions is left outside the scope of this document. In any case, it is expected that this control must be driven by the ingress LSR. 5.3 Explicit Path Loose Hops and Widely Scoped Abstract Nodes - A P2MP path is completely specified if all of the required + A P2MP tree is completely specified if all of the required branches and hops between a sender and leaf LSR are indicated. - A P2MP path is partially specified if only a subset of intermediate + A P2MP tree is partially specified if only a subset of intermediate branches and hops are indicated. This may be achieved using loose hops in the explicit path, or using widely scoped abstract - nodes such as IPv4 prefixes shorter than 32 bits or AS numbers. - A partially specified P2MP path may be particularly useful in + nodes such as IPv4 prefixes shorter than 32 bits, or AS numbers. + A partially specified P2MP tree may be particularly useful in inter-area and inter-AS situations. Protocol solutions SHOULD include a way to specify loose hops and widely scoped abstract nodes in the explicit source- - based control of the P2MP path as defined in the previous + based control of the P2MP tree as defined in the previous section. Where this support is provided, protocol solutions MUST allow downstream LSRs to apply further explicit - control to the P2MP path to resolve a partially specified path - into a (more) completely specified path. + control to the P2MP tree to resolve a partially specified tree + into a (more) completely specified tree. - Protocol solutions MUST allow the P2MP path to be completely + Protocol solutions MUST allow the P2MP tree to be completely specified at the ingress where sufficient information exists to allow - the full path to be computed. + the full tree to be computed. In all cases, the egress nodes of the P2MP TE LSP must be fully specified. - In case of path being computed by some downstream LSRs (e.g. case of - hops specified as loose hops), the solution SHOULD provide the + In case of a tree being computed by some downstream LSRs (e.g. the + case of hops specified as loose hops), the solution MUST provide the ability for the ingress LSR of the P2MP TE LSP to learn the full - P2MP path. Note that this requirement may be relaxed in some - environment (e.g. Inter-AS) where confidentiality must be preserved. + P2MP tree. Note that this requirement MAY be relaxed in some + environments (e.g. Inter-AS) where confidentiality must be preserved. 5.4 P2MP TE LSP establishment, teardown, and modification mechanisms - The P2MP TE solution must support large scale P2MP TE LSPs + The P2MP TE solution MUST support large scale P2MP TE LSPs establishment and teardown in a scalable manner. In addition to P2MP TE LSP establishment and teardown mechanism, - it SHOULD implement partial P2MP path modification mechanism. + it SHOULD implement partial P2MP tree modification mechanism. - For the purpose of adding sub-P2MP TE LSPs for existing P2MP TE LSP, - the extension SHOULD support grafting mechanism. For the purpose of - deleting a sub-P2MP TE LSPs from existing P2MP TE LSP, the extension - SHOULD support pruning mechanism. + For the purpose of adding sub-P2MP TE LSPs to an existing P2MP TE + LSP, the extensions SHOULD support a grafting mechanism. For the + purpose of deleting a sub-P2MP TE LSPs from an existing P2MP TE + LSP, the extensions SHOULD support a pruning mechanism. It is RECOMMENDED that these grafting and pruning operations do not cause any additional processing in nodes except along the path to the grafting and pruning node and its downstream nodes. Moreover, both grafting and pruning operations MUST not be traffic disruptive for - the traffic currently forwarded along the P2MP path. + the traffic currently forwarded along the P2MP tree. 5.5 Failure Reporting and Error Recovery Failure events may cause egress nodes or sub-P2MP LSPs to become - detached from the P2MP TE LSP. These events must be reported upstream + detached from the P2MP TE LSP. These events MUST be reported upstream as for a P2P LSP. The solution SHOULD provide recovery techniques such as protection - and restoration allowing to recover any impacted sub-P2MP TE LSPs. - In particular, it is required to provide fast protection mechanisms + and restoration allowing recovery of any impacted sub-P2MP TE LSPs. + In particular, a solution MUST provide fast protection mechanisms applicable to P2MP TE LSP similar to the solutions specified in [FRR] for P2P TE LSPs. Note also that no assumption is made on whether - backup paths for P2MP TE LSPs should or not be shared with P2P TE - LSPs backup paths. + backup paths for P2MP TE LSPs should or should not be shared with P2P + TE LSPs backup paths. A P2MP TE solution MUST support P2MP fast protection mechanism to handle P2MP applications sensitive to traffic disruption. The report of the failure of delivery to fewer than all of the egress nodes SHOULD NOT cause automatic teardown of the P2MP TE LSP. - That is, while some egress nodes remain connected to the P2MP path it + That is, while some egress nodes remain connected to the P2MP tree it should be a matter of local policy at the ingress whether the P2MP LSP is retained. - When all egress node downstreams of a branch node have become - disconnected from the P2MP path, and the some branch node is unable + When all egress nodes downstreams of a branch node have become + disconnected from the P2MP tree, and the some branch node is unable to restore connectivity to any of them through recovery or protection - mechanisms, the branch node MAY remove itself from the P2MP path. + mechanisms, the branch node MAY remove itself from the P2MP tree. Since the faults that severed the various downstream egress nodes - from the P2MP path may be disparate, the branch node MUST report all + from the P2MP tree may be disparate, the branch node MUST report all such errors to its upstream neighbor. The ingress node can then - decide to re-compute the path to that particular egress node, around - the failure point. + decide to re-compute the path to those particular egress nodes, + around the failure point. Solutions MAY include the facility for transit LSRs and particularly - branch nodes to recompute sub-P2MP paths to restore them after - failures. In the event of successful repair, no error notification is - reported to upstream nodes, but the new paths are reported if route - recording is in use. Crankback requirements are discussed in - [CRANKBACK]. + branch nodes to recompute sub-P2MP trees to restore them after + failures. In the event of successful repair, error notifications + SHOULD NOT be reported to upstream nodes, but the new paths are + reported if route recording is in use. Crankback requirements are + discussed in Section 5.18. 5.6 Record route of P2MP TE LSP tunnels Being able to identify the established topology of P2MP TE LSP is - very important for various purpose:Management, operation of some - local recovery mechanism like Fast Reroute [FRR]. A network operator - uses this information to manage P2MP TE LSP. Therefore, topology - information MUST be collected and updated after P2MP TE LSP + very important for various purposes such as management and operation + of some local recovery mechanisms like Fast Reroute [FRR]. A network + operator uses this information to manage P2MP TE LSPs. Therefore, + topology information MUST be collected and updated after P2MP TE LSP establishment and modification process. - For this purpose, conventional Record Route mechanism is useful. + For this purpose, the conventional Record Route mechanism is useful. As with other conventional mechanism, this information should be forwarded upstream towards the sender node. The P2MP TE solution MUST - support a mechanism which can collect and update P2MP path topology + support a mechanism which can collect and update P2MP tree topology information after P2MP LSP establishment and modification process. - It is RECOMMENDED that those information are collected in a data - format by which the sender node can recognize the P2MP path topology + It is RECOMMENDED that the information is collected in a data + format by which the sender node can recognize the P2MP tree topology without involving some complicated data calculation process. The solution MUST support the recording of both outgoing interfaces - or node-id [NODE-ID]. + and node-id [NODE-ID]. 5.7 Call Admission Control (CAC) and QoS Control mechanism of P2MP TE LSP tunnels - P2MP TE LSP share network resource with P2P TE LSP. Therefore it is - important to use CAC and QoS as P2P TE LSP for easy and scalable - operation. + P2MP TE LSPs may share network resource with P2P TE LSPs. Therefore + it is important to use CAC and QoS in the same way as P2P TE LSPs + for easy and scalable operation. - In particular, it should be highlighted that because - Multicast traffic cannot make use of point to point TE LSP, multicast - traffic cannot be easily taken into account by point to point in - order to perform CAC. The use of P2MP TE LSP will now allow for an - accounting of the unicast and multicast traffic for bandwidth - reservation. + In particular, it should be highlighted that because Multicast + traffic cannot make use of P2P TE LSP, multicast traffic cannot be + easily taken into account by P2P TE LSPs when performing CAC. + The use of P2MP TE LSP will now allow for an accounting of the + unicast and multicast traffic for bandwidth reservation. - P2MP TE solution MUST both supports FF and SE reservation style. + P2MP TE solutions MUST support both FF and SE reservation styles. - P2MP TE solution MUST be applicable to Diffserv-enabled network + P2MP TE solution MUST be applicable to Diffserv-enabled networks that can provide consistent QoS control in P2MP LSP traffic. - This solution SHOULD also satisfy DS-TE requirement [RFC3564] and - interoperable smoothly with current P2P DS-TE protocol specification. + Any solution SHOULD also satisfy the DS-TE requirements [RFC3564] and + interoperate smoothly with current P2P DS-TE protocol specifications. Note that this requirement document does not make any assumption on - the type of bandwidth pool used for P2MP TE LSP which can either be - shared with P2P TE LSP or be dedicated. + the type of bandwidth pool used for P2MP TE LSPs which can either be + shared with P2P TE LSP or be dedicated for P2MP use. 5.8 Reoptimization of P2MP TE LSP - The detection of a more optimal path is an example of situation where - P2MP TE LSP re-routing is may be required. While re-routing is in + The detection of a more optimal path is an example of a situation + where P2MP TE LSP re-routing may be required. While re-routing is in progress, an important requirement is avoiding double bandwidth reservation (over the common parts between the old and new LSP) thorough the use of resource sharing. Make-before-break (see [RFC3209]) delivers simultaneously a solution to these requirements. Make-before-break MUST be supported for a P2MP TE LSP to ensure that - there is no traffic disruption when the P2MP TE LSP is rerouted. + there is no traffic disruption when the P2MP TE LSP is re-routed. - There is a possibility to achieve make-before-break that only - applies to a sub-P2MP path without impacting the data on the all of - the other parts of the P2MP path. + It is possibile to achieve make-before-break that only + applies to a sub-P2MP tree without impacting the data on all of + the other parts of the P2MP tree. The solution SHOULD allow for make-before-break reoptimization of a sub-tree with no impact on the rest of the tree (no label - reallocation, no change in identifiers...). + reallocation, no change in identifiers, etc.). + + The solution SHOULD also provide the ability for the ingress LSR + to have a strict control on the reoptimization process. Such reoptimization MAY be initiated by the sub-tree root branch - node. (e.g. the branch node setup a new sub-tree, then splices + node (that is, the branch node MAY setup a new sub-tree, then splice traffic on the new subtree and delete the former sub-tree). 5.9 IPv4/IPv6 support - A P2MP TE solution MUST be applicable to IPv4/IPv6. + Any P2MP TE solution MUST be equally applicable to IPv4 and IPv6. 5.10 P2MP MPLS Label A P2MP TE solution MUST support establishment of both P2P and - P2MP TE LSP and MUST NOT impede the operation of P2P TE LSPs within + P2MP TE LSPs and MUST NOT impede the operation of P2P TE LSPs within the same network. A P2MP TE solution MUST be specified in such a way that it allows P2MP and P2P TE LSPs to be signaled on the same interface. Labels for P2MP TE LSPs and P2P TE LSPs MAY be assigned from shared or dedicated label space(s). Label space shareability is implementation specific. 5.11 Routing advertisement of P2MP capability - This document has identified several high-level requirements for - enhancements to routing and signalling protocols to support - P2MP MPLS. These are needed to facilitate the computation of P2MP - paths using TE constraints so that explicit source-control may be - applied to the LSP paths as they are signaled through the network. + Several high-level requirements have been identified to determine + the capabilities of LSRs within a P2MP network. This information is + to facilitate the computation of P2MP trees using TE constraints + within a network that contains LSRs that do not all have the same + capabilities levels with respect to P2MP signaling and data + forwarding. - These requirements include but not restricted to: + These capabilities include, but are not limited to: - the ability of an LSR to support branching. - the ability of an LSR to act as an egress and a branch for the same LSP. - The applicability of these requirements is for further study. - These requirements are developed in a separate document. + It is expected that it may be appropriate to gather this information + through extensions to TE IGPs (see [RFC3630] and [IS-IS-TE]), but the + precise requirements and mechanisms are out of the scope of this + document. It is expected that a separate document will cover this + requirement. 5.12 Multi-Area/AS LSP - P2MP TE solution SHOULD support multi-Area/AS LSP. + P2MP TE solutions SHOULD support multi-area/AS P2MP LSPs. - A separate document may deal with the specifics of inter-area - and inter-AS P2MP TE LSPs. + The precise requirements in support of multi-area/AS P2MP LSPs + is out of the scope of this document. It is expected that a separate + document will cover this requirement. -5.13 P2MP MPLS management +5.13 P2MP MPLS OAM - The MPLS MIB should be enhanced to provide P2MP TE LSP management. - P2MP TE LSPs MUST have a unique identifier whose definition MAY be - partially or entirely shared with P2P TE LSP identifiers used for - management purposes. + Management of P2MP LSPs is as important as the management of P2P + LSPs. + + The MPLS and GMPLS MIB modules MUST be enhanced to provide P2MP TE + LSP management. + + In order to facilitate correct management, P2MP TE LSPs MUST have + unique identifiers. + + OAM facilities will have special demands in P2MP environments + especially within the context of tracing the paths and connectivity + of P2MP TE LSPs. The precise requirements and mechanisms for OAM are + out of the scope of this document. It is expected that a separate + document will cover these requirements. 5.14 Scalability Scalability is a key requirement in P2MP MPLS systems. Solutions - should be designed to scale well with an increase in the number of - any of the following: the number of recipients, the number of branch - points and the number of branches. Both scalability of performance - and operation must be considered. + MUST be designed to scale well with an increase in the number of + any of the following: + - the number of recipients + - the number of branch points + - the number of branches. + Both scalability of performance and operation MUST be considered. - Key considerations may include: + Key considerations SHOULD include: - the amount of refresh processing associated with maintaining a P2MP TE LSP. - - the amount of protocol state that must be maintained by transit - LSRs along a P2MP path. + - the amount of protocol state that must be maintained by ingress + and transit LSRs along a P2MP tree. - the number of protocol messages required to set up or tear down a P2MP LSP as a function of the number of egress LSRs. - the number of protocol messages required to repair a P2MP LSP after failure or perform make-before-break. - the amount of protocol information transmitted to manage a P2MP TE LSP (i.e. the message size). - the amount of potential routing extensions. - the amount of control plane processing required by the ingress, transit and egress LSRs to add/delete a branch LSP to/from an existing P2MP LSP. 5.15 Backwards Compatibility - It should be an aim of any P2MP solution to offer as much backward + It SHOULD be an aim of any P2MP solution to offer as much backward compatibility as possible. An ideal would be to offer P2MP services across legacy MPLS networks without any change to any LSR in the network. - If this ideal cannot be achieved, the aim should be to use legacy + If this ideal cannot be achieved, the aim SHOULD be to use legacy nodes as both transit non-branch LSRs and egress LSRs. It is a further requirement of all protocol solutions that any LSR - that implements the solution shall not be prohibited by that act from + that implements the solution SHALL NOT be prohibited by that act from supporting P2P TE LSPs using existing signaling mechanisms. That is, - unless administratively prohibited, P2P TE LSPs must be supported + unless administratively prohibited, P2P TE LSPs MUST be supported through a P2MP network. 5.16 GMPLS Solutions for MPLS P2MP TE-LSPs when applied to GMPLS P2MP PSC - or non-PSC TE-LSPs must be backward and forward compatible with + or non-PSC TE-LSPs MUST be backward and forward compatible with the other features of GMPLS including: - o control and data plane separation (IF_ID RSVP_HOP and + - control and data plane separation (IF_ID RSVP_HOP and IF_ID ERROR_SPEC), - o full support of numbered and unnumbered TE links (see [RFC 3477] - and [GMPLS-ROUTING]), - o use of the GENERALIZED_LABEL_REQUEST and the GENERALIZED_LABEL + - full support of numbered and unnumbered TE links (see [RFC 3477] + and [GMPLS-ROUTE]), + - use of the GENERALIZED_LABEL_REQUEST and the GENERALIZED_LABEL (C-Type 2 and 3) in conjunction with the LABEL_SET and the ACCEPTABLE_LABEL_SET object, - o processing of the ADMIN_STATUS object, - o processing of the PROTECTION object, - o support of Explicit Label Control, - o processing of the Path_State_Removed Flag, - o handling of Graceful Deletion procedures. + - processing of the ADMIN_STATUS object, + - processing of the PROTECTION object, + - support of Explicit Label Control, + - processing of the Path_State_Removed Flag, + - handling of Graceful Deletion procedures. In addition, since non-PSC TE-LSPs may have to be processed in environments where the "P2MP capability" could be limited, specific constraints may also apply during the P2MP TE Path computation. Being technology specific, these constraints are outside the scope of this document. However, technology independent constraints (i.e. constraints that are applicable independently of the LSP class) - should be allowed during P2MP TE LSP message processing. It has to + SHOULD be allowed during P2MP TE LSP message processing. It has to be emphasized that path computation and management techniques shall - be as close as possible than those being used for PSC P2P TE LSPs + be as close as possible to those being used for PSC P2P TE LSPs and P2MP TE LSPs. Finally, note that bi-directional TE LSPs are not applicable to multicast traffic. Although many leaf nodes may be considered as senders in a multicast group, a P2MP TE LSP models a single distribution tree from a sender to multiple recipients. If such a tree were made bi-directional it would be a multipoint-to-point tree in the reverse direction. 5.17 Requirements for Hierarchical P2MP TE LSPs - [LSP-HIER] define concepts and procedures for P2P LSP hierarchy. They - should be extended to support P2MP LSP hierarchy. + [LSP-HIER] defines concepts and procedures for P2P LSP hierarchy. + + These procedures SHOULD be extended to support P2MP LSP hierarchy. The P2MP MPLS-TE solution SHOULD support the concept of region and region hierarchy (PSC1