--- 1/draft-ietf-mpls-rsvp-te-p2mp-03.txt 2006-05-01 22:12:24.000000000 +0200 +++ 2/draft-ietf-mpls-rsvp-te-p2mp-04.txt 2006-05-01 22:12:24.000000000 +0200 @@ -1,25 +1,25 @@ Network Working Group R. Aggarwal (Editor) Internet Draft Juniper Networks -Expiration Date: April 2006 +Expiration Date: October 2006 D. Papadimitriou (Editor) Alcatel S. Yasukawa (Editor) NTT - October 2005 + April 2006 Extensions to RSVP-TE for Point to Multipoint TE LSPs - draft-ietf-mpls-rsvp-te-p2mp-03.txt + draft-ietf-mpls-rsvp-te-p2mp-04.txt Status of this Memo By submitting this Internet-Draft, each author represents that any applicable patent or other IPR claims of which he or she is aware have been or will be disclosed, and any of which he or she becomes aware will be disclosed, in accordance with Section 6 of BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that @@ -61,150 +61,152 @@ 4.3 Sub-Groups ............................................ 6 4.4 S2L Sub-LSPs .......................................... 7 4.4.1 Representation of a S2L Sub-LSP ....................... 7 4.4.2 S2L Sub-LSPs and Path Messages ........................ 7 4.5 Explicit Routing ...................................... 8 5 Path Message .......................................... 10 5.1 Path Message Format ................................... 10 5.2 Path Message Processing ............................... 11 5.2.1 Multiple Path Messages ................................ 12 5.2.2 Multiple S2L Sub-LSPs in one Path message ............. 13 - 5.2.3 Transit Fragmentation ................................. 14 + 5.2.3 Transit Fragmentation ................................. 15 5.2.4 Control of Branch Fate Sharing ........................ 15 - 5.3 Grafting .............................................. 15 + 5.3 Grafting .............................................. 16 6 Resv Message .......................................... 16 6.1 Resv Message Format ................................... 16 - 6.2 Resv Message Processing ............................... 17 - 6.2.1 Resv Message Throttling ............................... 18 - 6.3 Record Routing ........................................ 18 - 6.3.1 RRO Processing ........................................ 18 + 6.2 Resv Message Processing ............................... 18 + 6.2.1 Resv Message Throttling ............................... 19 + 6.3 Record Routing ........................................ 19 + 6.3.1 RRO Processing ........................................ 19 6.4 Reservation Style ..................................... 19 - 7 PathTear Message ...................................... 19 - 7.1 PathTear Message Format ............................... 19 + 7 PathTear Message ...................................... 20 + 7.1 PathTear Message Format ............................... 20 7.2 Pruning ............................................... 20 7.2.1 Implicit S2L Sub-LSP Teardown ......................... 20 - 7.2.2 Explicit S2L Sub-LSP Teardown ........................ 20 + 7.2.2 Explicit S2L Sub-LSP Teardown ........................ 21 8 Notify and ResvConf Messages .......................... 21 8.1 Notify Messages ....................................... 21 - 8.2 ResvConf Messages ..................................... 22 - 9 Refresh Reduction ..................................... 23 -10 State Management ...................................... 23 -10.1 Incremental State Update .............................. 23 -10.2 Combining Multiple Path Messages ...................... 24 -11 Error Processing ...................................... 25 -11.1 PathErr Messages ...................................... 25 -11.2 ResvErr Messages ...................................... 26 -11.3 Branch Failure Handling ............................... 26 -12 Admin Status Change ................................... 27 + 8.2 ResvConf Messages ..................................... 23 + 9 Refresh Reduction ..................................... 24 +10 State Management ...................................... 24 +10.1 Incremental State Update .............................. 24 +10.2 Combining Multiple Path Messages ...................... 25 +11 Error Processing ...................................... 26 +11.1 PathErr Messages ...................................... 26 +11.2 ResvErr Messages ...................................... 27 +11.3 Branch Failure Handling ............................... 27 +12 Admin Status Change ................................... 28 -13 Label Allocation on LANs with Multiple Downstream Nodes. 28 -14 P2MP LSP and Sub-LSP Re-optimization .................. 28 -14.1 Make-before-break ..................................... 28 -14.2 Sub-Group Based Re-optimization ....................... 28 -15 Fast Reroute .......................................... 29 -15.1 Facility Backup ....................................... 29 -15.2 One to One Backup ..................................... 30 -16 Support for LSRs that are not P2MP Capable ............ 30 -17 Reduction in Control Plane Processing with LSP Hierarchy. 32 -18 P2MP LSP Remerging and Cross-Over ..................... 32 -18.1 Procedures ............................................ 33 -18.1.1 Re-Merge Procedures ................................... 34 -19 New and Updated Message Objects ....................... 36 -19.1 SESSION Object ........................................ 36 -19.1.1 P2MP LSP Tunnel IPv4 SESSION Object ................... 36 -19.1.2 P2MP LSP Tunnel IPv6 SESSION Object ................... 37 -19.2 SENDER_TEMPLATE object ................................ 37 -19.2.1 P2MP LSP Tunnel IPv4 SENDER_TEMPLATE Object ........... 38 -19.2.2 P2MP LSP Tunnel IPv6 SENDER_TEMPLATE Object ........... 39 -19.3 Object .................................. 40 -19.3.1 IPv4 Object ............................. 40 -19.3.2 IPv6 Object ............................. 40 -19.4 FILTER_SPEC Object .................................... 40 -19.4.1 P2MP LSP_IPv4 FILTER_SPEC Object ...................... 41 -19.4.2 P2MP LSP_IPv4 FILTER_SPEC Object ...................... 41 -19.5 P2MP SECONDARY_EXPLICIT_ROUTE Object (SERO) ........... 41 -19.6 P2MP SECONDARY_RECORD_ROUTE Object (SRRO) ............. 41 -20 IANA Considerations ................................... 41 -20.1 New Class Numbers ..................................... 41 -20.2 New Class Types ....................................... 42 -20.3 New Error Codes ....................................... 42 -20.4 LSP Attributes Flags .................................. 43 -21 Security Considerations ............................... 43 -22 Acknowledgements ...................................... 43 -23 Appendix .............................................. 43 -23.1 Example ............................................... 43 -24 References ............................................ 45 -24.1 Normative References .................................. 45 -24.2 Informative References ................................ 46 -25 Author Information .................................... 47 -25.1 Editor Information .................................... 47 -25.2 Contributor Information ............................... 47 -26 Intellectual Property ................................. 50 -27 Full Copyright Statement .............................. 50 -28 Acknowledgement ....................................... 51 +13 Label Allocation on LANs with Multiple Downstream Nodes ..28 +14 P2MP LSP and Sub-LSP Re-optimization .................. 29 +14.1 Make-before-break ..................................... 29 +14.2 Sub-Group Based Re-optimization ....................... 29 +15 Fast Reroute .......................................... 30 +15.1 Facility Backup ....................................... 30 +15.1.1 Link Protection ....................................... 30 +15.1.2 Node Protection ....................................... 31 +15.2 One to One Backup ..................................... 31 +16 Support for LSRs that are not P2MP Capable ............ 32 +17 Reduction in Control Plane Processing with LSP Hierarchy..34 +18 P2MP LSP Remerging and Cross-Over ..................... 34 +18.1 Procedures ............................................ 35 +18.1.1 Re-Merge Procedures ................................... 36 +19 New and Updated Message Objects ....................... 38 +19.1 SESSION Object ........................................ 38 +19.1.1 P2MP LSP Tunnel IPv4 SESSION Object ................... 38 +19.1.2 P2MP LSP Tunnel IPv6 SESSION Object ................... 39 +19.2 SENDER_TEMPLATE object ................................ 39 +19.2.1 P2MP LSP Tunnel IPv4 SENDER_TEMPLATE Object ........... 40 +19.2.2 P2MP LSP Tunnel IPv6 SENDER_TEMPLATE Object ........... 40 +19.3 Object .................................. 41 +19.3.1 IPv4 Object ............................. 41 +19.3.2 IPv6 Object ............................. 42 +19.4 FILTER_SPEC Object .................................... 42 +19.4.1 P2MP LSP_IPv4 FILTER_SPEC Object ...................... 42 +19.4.2 P2MP LSP_IPv4 FILTER_SPEC Object ...................... 42 +19.5 P2MP SECONDARY_EXPLICIT_ROUTE Object (SERO) ........... 43 +19.6 P2MP SECONDARY_RECORD_ROUTE Object (SRRO) ............. 43 +20 IANA Considerations ................................... 43 +20.1 New Class Numbers ..................................... 43 +20.2 New Class Types ....................................... 43 +20.3 New Error Values ...................................... 44 +20.4 LSP Attributes Flags .................................. 45 +21 Security Considerations ............................... 45 +22 Acknowledgements ...................................... 45 +23 Appendix .............................................. 45 +23.1 Example ............................................... 45 +24 References ............................................ 47 +24.1 Normative References .................................. 47 +24.2 Informative References ................................ 48 +25 Author Information .................................... 49 +25.1 Editor Information .................................... 49 +25.2 Contributor Information ............................... 49 +26 Intellectual Property ................................. 52 +27 Full Copyright Statement .............................. 52 +28 Acknowledgement ....................................... 53 1. Conventions used in this document 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 RFC-2119 [KEYWORDS]. 2. Terminology This document uses terminologies defined in [RFC3031], [RFC2205], - [RFC3209], [RFC3473] and [P2MP-REQ]. + [RFC3209], [RFC3473] and [RFC4461]. 3. Introduction [RFC3209] defines a mechanism for setting up P2P TE LSPs in MPLS - networks. [RFC3473] defines extensions to [RFC3209] for setting up P2P - TE LSPs in GMPLS networks. However these specifications do not + networks. [RFC3473] defines extensions to [RFC3209] for setting up + P2P TE LSPs in GMPLS networks. However these specifications do not provide a mechanism for building P2MP TE LSPs. - This document defines extensions to RSVP-TE protocol [RFC3209, - RFC3473] to support P2MP TE LSPs satisfying the set of requirements - described in [P2MP-REQ]. + This document defines extensions to the RSVP-TE protocol [RFC3209, + RFC3473 to support P2MP TE LSPs satisfying the set of requirements + described in [RFC4461]. This document relies on the semantics of RSVP that RSVP-TE inherits - for building P2MP LSPs. A P2MP LSP is comprised of multiple S2L - sub-LSPs. These S2L sub-LSPs are set up between the ingress and egress + for building P2MP LSPs. A P2MP LSP is comprised of multiple S2L sub- + LSPs. These S2L sub-LSPs are set up between the ingress and egress LSRs and are appropriately combined by the branch LSRs using RSVP semantics to result in a P2MP TE LSP. One Path message may signal one or multiple S2L sub-LSPs. Hence the S2L sub-LSPs belonging to a P2MP LSP can be signaled using one Path message or split across multiple Path messages. - Path computation and P2MP application specific aspects are outside of + Path computation and P2MP application specific aspects are outside the scope of this document. 4. Mechanism This document describes a solution that optimizes data replication by allowing non-ingress nodes in the network to be replication/branch - nodes. A branch node is a LSR that is capable of replicating the + nodes. A branch node is an LSR that is capable of replicating the incoming data on two or more outgoing interfaces. The solution relies on RSVP-TE in the network for setting up a P2MP TE LSP. - The P2MP TE LSP is set up by associating multiple S2L TE sub-LSPs and + The P2MP TE LSP is set up by associating multiple S2L sub-LSPs and relying on data replication at branch nodes. This is described further in the following sub-sections by describing P2MP Tunnels and how they relate to S2L sub-LSPs. 4.1. P2MP Tunnels - The specific aspect related to P2MP TE LSP is the action required at - a branch node, where data replication occurs. Incoming MPLS labeled - data is appropriately replicated to several outgoing interfaces which - may have different labels. + The specific aspect related to a P2MP TE LSP is the action required + at a branch node, where data replication occurs. Incoming MPLS + labeled data is appropriately replicated to several outgoing + interfaces which may have different labels. - A P2MP TE Tunnel comprises of one or more P2MP LSPs. A P2MP TE Tunnel - is identified by a P2MP SESSION object. This object contains the + A P2MP TE Tunnel comprises one or more P2MP LSPs. A P2MP TE Tunnel is + identified by a P2MP SESSION object. This object contains the identifier of the P2MP Session which includes the P2MP ID, a tunnel ID and an extended tunnel ID. The fields of a P2MP SESSION object are identical to those of the SESSION object defined in [RFC3209] except that the Tunnel Endpoint Address field is replaced by the P2MP Identifier (P2MP ID) field. The P2MP ID provides an identifier for the set of destinations of the P2MP TE Tunnel. @@ -214,112 +216,115 @@ ID, and Extended Tunnel ID that are part of the P2MP SESSION object, and the tunnel sender address and LSP ID fields of the P2MP SENDER_TEMPLATE object. The new P2MP SENDER_TEMPLATE object is defined in section 20.2. 4.3. Sub-Groups As with all other RSVP controlled LSPs, P2MP LSP state is managed using RSVP messages. While use of RSVP messages is the same, P2MP LSP state differs from P2P LSP state in a number of ways. The two most - notable differences are that a P2MP LSP comprises multiple S2L - Sub-LSPs and that, as a result of this, it may not be possible to - represent full state in a single IP packet and even more likely that it - can't fit into a single IP packet. It must also be possible to + notable differences are that a P2MP LSP comprises multiple S2L Sub- + LSPs and that, as a result of this, it may not be possible to + represent full state in a single IP packet and even more likely that + it can't fit into a single IP packet. It must also be possible to efficiently add and remove endpoints to and from P2MP TE LSPs. An - additional issue is that P2MP LSP must also handle the state "remerge" - problem, see [P2MP-REQ]. + additional issue is that the P2MP LSP must also handle the state + "remerge" problem, see [RFC4461]. These differences in P2MP state are addressed through the addition of - a sub-group identifier (Sub-Group ID) and sub-group originator - (Sub-Group Originator ID) to the SENDER_TEMPLATE and FILTER_SPEC - objects. Taken together the Sub-Group ID and Sub-Group Originator ID - are referred to as the Sub-Group fields. + a sub-group identifier (Sub-Group ID) and sub-group originator (Sub- + Group Originator ID) to the SENDER_TEMPLATE and FILTER_SPEC objects. + + Taken together the Sub-Group ID and Sub-Group Originator ID are + referred to as the Sub-Group fields. The Sub-Group fields, together with rest of the SENDER_TEMPLATE and SESSION objects, are used to represent a portion of a P2MP LSP's state. This portion of a P2MP LSP's state refers only to signaling state and not data plane replication or branching. For example, it is possible for a node to "branch" signaling state for a P2MP LSP, but to not branch the data associated with the P2MP LSP. Typical applications for generation and use of multiple subgroups are adding an egress and semantic fragmentation to ensure that a Path message remains within a single IP packet. 4.4. S2L Sub-LSPs A P2MP LSP is constituted of one or more S2L sub-LSPs. 4.4.1. Representation of a S2L Sub-LSP - A S2L sub-LSP exists within the context of a P2MP LSP. Thus it is + An S2L sub-LSP exists within the context of a P2MP LSP. Thus it is identified by the P2MP ID, Tunnel ID, and Extended Tunnel ID that are part of the P2MP SESSION, the tunnel sender address and LSP ID fields of the P2MP SENDER_TEMPLATE object, and the S2L sub-LSP destination address that is part of the object. The object is defined in section 20.3. An EXPLICIT_ROUTE Object (ERO) or P2MP SECONDARY_EXPLICIT_ROUTE Object (SERO) is used to optionally specify the explicit route of a - S2L sub-LSP. Each ERO or a SERO that is signaled corresponds to a + S2L sub-LSP. Each ERO or SERO that is signaled corresponds to a particular object. Details of explicit route encoding are specified in section 4.5. The SECONDARY_EXPLICIT_ROUTE Object is defined in [RECOVERY], a new P2MP SECONDARY_EXPLICIT_ROUTE Object C- - C-type is defined in Section 20.5 and a matching P2MP + type is defined in Section 20.5 and a matching P2MP SECONDARY_RECORD_ROUTE Object C-type is defined in Section 20.6. 4.4.2. S2L Sub-LSPs and Path Messages The mechanism in this document allows a P2MP LSP to be signaled using one or more Path messages. Each Path message may signal one or more S2L sub-LSPs. Support for multiple Path messages is desirable as one - Path message may not be large enough to fit all the S2L sub-LSPs; and - they also allow separate manipulation of sub-trees of the P2MP LSP. - The reason for allowing a single Path message, to signal multiple S2L - sub-LSPs, is to optimize the number of control messages needed to - setup a P2MP LSP. + Path message may not be large enough to contain all the S2L sub-LSPs; + and they also allow separate manipulation of sub-trees of the P2MP + LSP. The reason for allowing a single Path message, to signal + multiple S2L sub-LSPs, is to optimize the number of control messages + needed to setup a P2MP LSP. 4.5. Explicit Routing When a Path message signals a single S2L sub-LSP (that is, the Path message is only targeting a single leaf in the P2MP tree), the EXPLICIT_ROUTE object encodes the path from the ingress LSR to the egress LSR. The Path message also includes the object for the S2L sub-LSP being signaled. The < [], > tuple represents the S2L sub-LSP and is referred to as the sub-LSP descriptor. The absence of the ERO should be interpreted as requiring hop-by-hop routing for the sub-LSP based on - the S2L sub-LSP destination address field of the object. + the S2L sub-LSP destination address field of the + object. When a Path message signals multiple S2L sub-LSPs the path of the first S2L sub-LSP, from the ingress LSR to the egress LSR, is encoded in the ERO. The first S2L sub-LSP is the one that corresponds to the first object in the Path message. The S2L sub-LSPs - coresponding to the objects that follow are termed as - subsequent S2L sub-LSPs. In order to avoid the potential repetition - of path information for the parts of S2L sub-LSPs that share hops, - this information is deduced from the explicit routes of other S2L - sub-LSPs using explicit route compression in SEROs. + corresponding to the objects that follow are termed as + subsequent S2L sub-LSPs. The path of each subsequent S2L sub-LSP is encoded in a P2MP SECONDARY_EXPLICIT_ROUTE object (SERO). The format of the SERO is the same as an ERO (as defined in [RFC3209]). Each subsequent S2L sub-LSP - is represented by tuples of the form < [] >. There is a one to one - correspondence between a object and a SERO. A SERO for a - particular S2L sub-LSP includes only the path from a certain branch - LSR to the egress LSR if the path to that branch LSR can be derived - from the ERO or other SEROs. The absence of a SERO should be - interpreted as requiring hop-by-hop routing for that S2L sub-LSP. Note - that the destination address is carried in the S2L sub-LSP object. - The encoding of the SERO and object are described in - detail in section 20. + is represented by tuples of the form < [] >. An SERO for a particular + S2L sub-LSP includes only the path from a certain branch LSR to the + egress LSR if the path to that branch LSR can be derived from the ERO + or other SEROs. The absence of an SERO should be interpreted as + requiring hop-by-hop routing for that S2L sub-LSP. Note that the + destination address is carried in the S2L sub-LSP object. The + encoding of the SERO and object are described in detail + in section 20. + + In order to avoid the potential repetition of path information for + the parts of S2L sub-LSPs that share hops, this information is + deduced from the explicit routes of other S2L sub-LSPs using explicit + route compression in SEROs. Explicit route compression is illustrated using the following figure. A | | B | | C----D----E @@ -331,22 +336,22 @@ J K L M | | | | | | | | N O P Q--R Figure 1. Explicit Route Compression Figure 1. shows a P2MP LSP with LSR A as the ingress LSR and six egress LSRs: (F, N, O, P, Q and R). When all the six S2L sub-LSPs are signaled in one Path message let us assume that the S2L sub-LSP to - LSR F is the first S2L sub-LSP and the rest are subsequent S2L - sub-LSPs. Following is one way for the ingress LSR A to encode the S2L + LSR F is the first S2L sub-LSP and the rest are subsequent S2L sub- + LSPs. Following is one way for the ingress LSR A to encode the S2L sub-LSP explicit routes using compression: S2L sub-LSP-F: ERO = {B, E, D, C, F}, object-F S2L sub-LSP-N: SERO = {D, G, J, N}, object-N S2L sub-LSP-O: SERO = {E, H, K, O}, object-O S2L sub-LSP-P: SERO = {H, L, P}, object-P, S2L sub-LSP-Q: SERO = {H, I, M, Q}, object-Q, S2L sub-LSP-R: SERO = {Q, R}, object-R, After LSR E processes the incoming Path message from LSR B it sends a @@ -412,191 +416,220 @@ [ ] [ ] [ ... ] [ ] [ ] [ ] [ ... ] [] + Following is the format of the S2L sub-LSP descriptor list. ::= [ ] - ::= [ ] + ::= [ ] Each LSR MUST use the common objects in the Path message and the S2L sub-LSP descriptors to process each S2L sub-LSP represented by the object and the SECONDARY-/EXPLICIT_ROUTE object combination. The first object's explicit route is specified by the ERO. Explicit routes of subsequent S2L sub-LSPs are specified by the corresponding SERO. A SERO corresponds to the following object. The RRO in the sender descriptor contains the hops traversed by the Path message and applies to all the S2L sub-LSPs signaled in the Path message. Path message processing is described in the next section. 5.2. Path Message Processing - The ingress-LSR initiates the set up of a S2L sub-LSP to each egress - LSR that is the destination of the P2MP LSP. Each S2L sub-LSP is - associated with the same P2MP LSP using common P2MP SESSION object + The ingress-LSR initiates the set up of an S2L sub-LSP to each + egress-LSR that is the destination of the P2MP LSP. Each S2L sub-LSP + is associated with the same P2MP LSP using common P2MP SESSION object and fields in the P2MP SENDER_TEMPLATE object. Hence it can be combined with other S2L sub-LSPs to form a P2MP LSP. Another S2L sub-LSP belonging to the same instance of this S2L sub-LSP (i.e. the same P2MP LSP) shares resources with this S2L sub-LSP. The session corresponding to the P2MP TE tunnel is determined based on the P2MP SESSION object. Each S2L sub-LSP is - identified using the object. Explicit routing for the S2L - sub-LSPs is achieved using the ERO and SEROs. + identified using the object. Explicit routing for the + S2L sub-LSPs is achieved using the ERO and SEROs. As mentioned earlier, it is possible to signal S2L sub-LSPs for a - given P2MP LSP in one or more Path messages. And a given Path message + given P2MP LSP in one or more Path messages and a given Path message can contain one or more S2L sub-LSPs. A LSR that supports RSVP-TE signaled P2MP LSPs MUST be able to receive and process multiple Path messages for the same P2MP LSP and multiple S2L sub-LSPs in one Path - message. This implies that a LSR MUST be able to receive and process - all objects listed in section 20. + message. This implies that such an LSR MUST be able to receive and + process all objects listed in section 20. 5.2.1. Multiple Path Messages As described in section 3, either the or the tuple is used to specify a S2L sub-LSP. Multiple Path messages can be used to signal a P2MP LSP. Each Path message can signal one or more S2L sub-LSPs. If a Path message contains only one S2L sub-LSP, each LSR along the S2L sub-LSP follows [RFC3209] procedures for processing the Path message - besides the object processing described in this docu- - ment. + besides the object processing described in this + document. Processing of Path messages containing more than one S2L sub-LSP is described in Section 5.2.2. An ingress LSR may use multiple Path messages for signaling a P2MP LSP. This may be because a single Path message may not be large enough to signal the P2MP LSP. Or it may be while adding leaves to the P2MP LSP the new leaves are signaled in a new Path message. Or an ingress LSR MAY choose to break the P2MP tree into separate - manageable P2MP trees. These trees share the same root and may share the - trunk and certain branches. The scope of this management - decomposition of P2MP trees is bounded by a single tree (the P2MP Tree) - and multiple trees with a single leaf each (S2L sub-LSPs). Per - [P2MP-REQ], a P2MP LSP MUST have consistent attributes across all + manageable P2MP trees. These trees share the same root and may share + the trunk and certain branches. The scope of this management + decomposition of P2MP trees is bounded by a single tree (the P2MP + Tree) and multiple trees with a single leaf each (S2L sub-LSPs). Per + [RFC4461], a P2MP LSP MUST have consistent attributes across all portions of a tree. This implies that each Path message that is used to signal a P2MP LSP is signaled using the same signaling attributes - with the exception of the S2L sub-LSP information. + with the exception of the S2L sub-LSP information and Sub-Group + identifiers. The resulting sub-LSPs from the different Path messages belonging to the same P2MP LSP SHOULD share labels and resources where they share hops to prevent multiple copies of the data being sent. In certain cases a transit LSR may need to generate multiple Path messages to signal state corresponding to a single received Path message. For instance ERO expansion may result in an overflow of the resultant Path message. In this case the message can be decomposed into multiple Path messages such that each of the messages carry a subset of the X2L sub-tree carried by the incoming message. - Multiple Path messages generated by a LSR that signal state for the + Multiple Path messages generated by an LSR that signal state for the same P2MP LSP are signaled with the same SESSION object and have the same in the SENDER_TEMPLATE object. In order - to disambiguate these Path messages a tuple is introduced (also referred to as the Sub-Group + to disambiguate these Path messages a tuple is introduced (also referred to as the Sub-Group field) and encoded in the SENDER_TEMPLATE object. Multiple Path messages generated by a LSR to signal state for the same P2MP LSP have the same Sub-Group Originator ID and have a different sub-Group - ID. The Sub-Group Originator ID SHOULD be set to the TE Router ID of + ID. The Sub-Group Originator ID MUST be set to the TE Router ID of the LSR that originates the Path message. This is either the ingress - LSR or a LSR which re-originates the Path message with its own Sub-Group - Originator ID. Cases when a transit LSR may change the Sub-Group - Originator ID of an incoming Path message are described below. The - tuple is globally unique. The - sub-Group ID space is specific to the Sub-Group Originator ID. + LSR or a LSR which re-originates the Path message with its own Sub- + Group Originator ID. Cases when a transit LSR may change the Sub- + Group Originator ID of an incoming Path message are described below. + The tuple is globally unique. + The sub-Group ID space is specific to the Sub-Group Originator ID. Therefore the combination is network-wide unique. Also, a router that changes the Sub-Group originator ID of an incoming Path message MUST use the same value of the Sub-Group Originator ID for all outgoing Path messages, for a particular P2MP LSP, and SHOULD not vary it during the life of the P2MP LSP. 5.2.2. Multiple S2L Sub-LSPs in one Path message The S2L sub-LSP descriptor list allows the signaling of one or more S2L sub-LSPs in one Path message. It is possible to signal multiple - object and ERO/SERO combinations in a single Path mes- - sage. Note that these two objects are the ones that differentiate a - S2L sub-LSP. + object and ERO/SERO combinations in a single Path + message. Note that these two objects differentiate a S2L sub-LSP. All LSRs MUST process the ERO corresponding to the first S2L sub-LSP - when the ERO is present. If one or more SEROs are present an ERO MUST + if the ERO is present. If one or more SEROs are present an ERO MUST be present. The first S2L sub-LSP MUST be propagated in a Path - message by each LSR along the explicit route specified by the ERO. A - LSR MUST process a S2L sub-LSP descriptor for a subsequent S2L sub-LSP - only if the first hop in the corresponding SERO is a local address of - that LSR. If this is not the case the S2L sub-LSP descriptor MUST be - included in the Path message sent to LSR that is the next hop to - reach the first hop in the SERO. This next hop is determined by using - the ERO or other SEROs that encode the path to the SERO's first hop. - If this is the case and the LSR is also the egress, the S2L sub-LSP - descriptor MUST NOT be propagated downstream. If this is the case and - the LSR is not the egress the S2L sub-LSP descriptor MUST be included - in a Path message sent to the next-hop determined from the SERO. + message by each LSR along the explicit route specified by the ERO, if + the ERO is present. Else it MUST be propagated using hop-by-hop + routing towards the destination identified by the + object. + + A LSR MUST process a S2L sub-LSP descriptor for a subsequent S2L sub- + LSP as follows: + + If the object is followed by an SERO, the LSR MUST check + the first hop in the SERO: + - If the first hop of the SERO identifies a local address of the + LSR, and the LSR is also the egress identified by the + object, the descriptor MUST NOT be propagated + downstream, but the SERO may be used for egress control per + [RFC4003]. + - If the first hop of the SERO identifies a local address of the + LSR, and the LSR is not the egress as identified by the + object the S2L sub-LSP descriptor MUST be + included in a Path message sent to the next-hop determined + from the SERO. + - If the first hop of the SERO is not a local address of the LSR + the S2L sub-LSP descriptor MUST be included in the Path message + sent to LSR that is the next hop to reach the first hop in the + SERO. This next hop is determined by using the ERO or other + SEROs that encode the path to the SERO's first hop. + + If the object is not followed by an SERO, the LSR MUST + examine the object: + - If this LSR is the egress as identified by the + object, the S2L sub-LSP descriptor MUST NOT be propagated + downstream. + - If this LSR is not the egress as identified by the + object, the LSR MUST make a routing decision to determine the + next hop towards the egress, and MUST include the S2L sub-LSP + descriptor in a Path message sent to the next-hop towards the + egress. In this case, the LSR MAY insert an SERO into the + S2L sub-LSP descriptor. + Hence a branch LSR MUST only propagate the relevant S2L sub-LSP descriptors on each downstream link. A S2L sub-LSP descriptor list that is propagated on a downstream link MUST only contain those S2L sub-LSPs that are routed using that link. This processing MAY result in a subsequent S2L sub-LSP in an incoming Path message to become the first S2L sub-LSP in an outgoing Path message. Note that if one or more SEROs contain loose hops, expansion of such loose hops MAY result in overflowing the Path message size. Section 5.2.3 describes how signaling of the set of S2L sub-LSPs can be split in more than one Path message. The RECORD_ROUTE Object (RRO) contains the hops traversed by the Path - message and applies to all the S2L sub-LSPs signaled in the path + message and applies to all the S2L sub-LSPs signaled in the Path message. A transit LSR MUST append its address in an incoming RRO and propagate it downstream. A branch LSR MUST form a new RRO for each of - the outgoing Path messages. Each such updated RRO MUST be formed - using the rules in [RFC3209]. + the outgoing Path messages by copying the RRO from the incoming Path + message and appending its address. Each such updated RRO MUST be + formed using the rules in [RFC3209]. If a LSR is unable to support a S2L sub-LSP in a Path message, a PathErr message MUST be sent for the impacted S2L sub-LSP, and normal processing of the rest of the P2MP LSP SHOULD continue. The default behavior is that the remainder of the LSP is not impacted (that is, all other branches are allowed to set up) and the failed branches are reported in PathErr messages in which the Path_State_Removed flag MUST NOT be set. However, the ingress LSR may set a LSP Integrity flag to request that if there is a setup failure on any branch the entire LSP should fail to set up. This is described further in section 12. 5.2.3. Transit Fragmentation In certain cases a transit LSR may need to generate multiple Path messages to signal state corresponding to a single received Path message. For instance ERO expansion may result in an overflow of the resultant Path message. It is desirable not to rely on IP - fragmentation in this case. In order to achieve this, the multiple Path - messages generated by the transit LSR, are signaled with the Sub-Group - Originator ID set to the TE Router ID of the transit LSR and a dis- - tinct sub-Group ID. Thus each distinct Path message that is generated - by the transit LSR for the P2MP LSP carries a distinct tuple. + fragmentation in this case. In order to achieve this, the multiple + Path messages generated by the transit LSR, are signaled with the + Sub-Group Originator ID set to the TE Router ID of the transit LSR + and a distinct sub-Group ID for each Path message. Thus each distinct + Path message that is generated by the transit LSR for the P2MP LSP + carries a distinct tuple. When multiple Path messages are used by an ingress or transit node, each Path message SHOULD be identical with the exception of the S2L sub-LSP related information (e.g., SERO), message and hop information (e.g., INTEGRITY, MESSAGE_ID and RSVP_HOP), and the sub-group fields of the SENDER_TEMPLATE objects. Except when performing a make- before-break operation as specified in section 14.1, the tunnel sender address and LSP ID fields MUST be the same in each message, and for transit nodes, the same as the values in the received Path message. @@ -616,22 +649,21 @@ failure during LSP setup or after an LSP has been established. The default behavior is that only the branches downstream of the failure are not established, but the ingress may request 'LSP integrity' such that any failure anywhere within the LSP tree causes the entire P2MP LSP to fail. The ingress LSP may request 'LSP integrity' by setting bit [TBA] of the Attributes Flags TLV. The bit is set if LSP integrity is required. - It is RECOMMENDED to use the LSP_ATTRIBUTES Object for this flag and - not the LSP_REQUIRED_ATTRIBUTES Object. + It is RECOMMENDED to use the LSP_REQUIRED_ATTRIBUTES Object. A branch LSR that supports the Attributes Flags TLV and recognizes this bit MUST support LSP integrity or reject the LSP setup with a PathErr message carrying the error "Routing Error"/"Unsupported LSP Integrity" 5.3. Grafting The operation of adding egress LSR(s) to an existing P2MP LSP is termed as grafting. This operation allows egress nodes to join a P2MP @@ -639,23 +671,23 @@ There are two methods to add S2L sub-LSPs to a P2MP LSP. The first is to add new S2L sub-LSPs to the P2MP LSP by adding them to an existing Path message and refreshing the entire Path message. Path message processing described in section 4 results in adding these S2L sub-LSPs to the P2MP LSP. Note that as a result of adding one or more S2L sub-LSPs to a Path message the ERO compression encoding may have to be recomputed. The second is to use incremental updates described in section 10.1. - The egress LSRs can be added by signaling only the impacted S2L - sub-LSPs in a new Path message. Hence other S2L sub-LSPs do not have - to be re-signaled. + The egress LSRs can be added by signaling only the impacted S2L sub- + LSPs in a new Path message. Hence other S2L sub-LSPs do not have to + be re-signaled. 6. Resv Message 6.1. Resv Message Format The Resv message follows the [RFC3209] and [RFC3473] format: ::= [ ] [ [ | ] ... ] [ ] @@ -687,200 +718,200 @@ list> ] ::=