Network Working Group                             Seisho Yasukawa (NTT)
Internet Draft                                                   Editor
Category: Informational

Expiration Date: December 2004                                July February 2005                           September 2004

   Requirements for Point to Multipoint Traffic Engineered MPLS LSPs
               <draft-ietf-mpls-p2mp-requirement-03.txt>
               <draft-ietf-mpls-p2mp-requirement-04.txt>

Status of this Memo

    By submitting this Internet-Draft, I certify that any applicable
    patent or other IPR claims of which I am aware have been disclosed,
    or will be disclosed, and any of which I become aware will be
    disclosed, in accordance with RFC 3668.

    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.

    Internet-Drafts are draft documents valid for a maximum of six months
    and may be updated, replaced, or obsoleted by other documents at any
    time. It is inappropriate to use Internet-Drafts as reference
    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/1id-abstracts.html

    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)
    Point-to-Multipoint (P2MP) Traffic Engineered (TE) Multiprotocol
    Label Switching (MPLS) Label Switched Paths (LSPs). It specifies
    functional requirements for solutions in order to deliver P2MP
    applications over a MPLS TE infrastructure. It is intended that
    solutions that specify procedures for P2MP TE LSP setup satisfy
    these requirements.

    There is no intent to either specify solution specific details in
    this document or application specific requirements.

    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 attempt to be equally applicable to MPLS and GMPLS.

    Table of Contents

    1. Introduction ................................................. .................................................. 04
    2. Definitions .................................................. 05 ................................................... 07
       2.1 Acronyms ................................................. 05 .................................................. 07
       2.2 Terminology .............................................. 06 ............................................... 07
       2.3 Conventions .............................................. 07 ............................................... 09
    3. Problem Statement ............................................ 07 ............................................. 09
       3.1 Motivation ............................................... 07
       3.2 ................................................ 09
       3.2. Requirements Overview .................................... 08 10
    4. Examples of candidate applications that may require P2MP TE LSP ...................................................10 12
       4.1 P2MP TE LSP for IP multicast data ....................... 10 ......................... 13
       4.2  P2MP TE backbone network for IP multicast network ....... 11 ........ 13
       4.3  Layer 2 Multicast Over MPLS ............................. 13 .............................. 14
       4.4 VPN multicast network ................................... 13 ..................................... 15
       4.5 GMPLS Networks .......................................... 14 ............................................ 16
    5. Detailed requirements for P2MP TE extensions ................. 15 .................. 16
       5.1 P2MP LSP tunnels ........................................ 15 .......................................... 16
       5.2 P2MP explicit routing ................................... 15 ..................................... 17
       5.3 Explicit Path Loose Hops and Widely Scoped Abstract Nodes.17 Nodes . 18
       5.4 P2MP TE LSP establishment, teardown, and modification
            mechanisms .............................................. 17 mecha 19
       5.5 Fragmentation ........................................... 18 ............................................. 19
       5.6 Failure Reporting and Error Recovery .................... 18 ...................... 20
       5.7 Record route of P2MP TE LSP tunnels ..................... 19 ....................... 21
       5.8 Call Admission Control (CAC) and QoS Control mechanism .. 19 .... 21
       5.9  Reoptimization Variation of P2MP TE LSP ........................... 20 Parameters ............................... 22
       5.10 Re-optimization of P2MP TE LSPs .......................... 22
       5.11 Tree Remerge ............................................. 23
       5.12 Data Duplication ......................................... 24
       5.13 IPv4/IPv6 support ....................................... 20
       5.11 ........................................ 24
       5.14 P2MP MPLS Label ......................................... 21
       5.12 .......................................... 24
       5.15 Routing advertisement of P2MP capability ................ 21
       5.13 ................. 24
       5.16 Multi-Area/AS LSP ....................................... 21
       5.14 ........................................ 25
       5.17 Multi-access LANs ........................................ 25
       5.18 P2MP MPLS OAM ........................................... 21
       5.15 ............................................ 25
       5.19 Scalability ............................................. 22
       5.16 .............................................. 26
       5.20 Backwards Compatibility ................................. 22
       5.17 .................................. 28
       5.21 GMPLS ................................................... 23
       5.18 .................................................... 28
       5.22 Requirements for Hierarchical P2MP TE LSPs .............. 24
       5.19 ............... 29
       5.23 P2MP Crankback routing .................................. 24 ................................... 29
    6. Security Considerations ...................................... 24 ....................................... 29
    7. Acknowledgements ............................................. 25 .............................................. 30
    8. References ................................................... 25 .................................................... 30
       8.1 Normative References ..................................... 25 ...................................... 30
       8.2 Informational References ................................. 26 .................................. 31
    9. Editor's Address ............................................. 27 .............................................. 32
    10. Authors' Addresses .......................................... 27 ........................................... 32
    11. Intellectual Property Consideration ......................... 29
       11.1 IPR Disclosure Acknowledgement .......................... 29 34
    12. Full Copyright Statement .................................... 29 ..................................... 34

1. Introduction

    Existing MPLS Traffic Engineering (MPLS-TE) allows for strict QoS
    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
    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

    [RFC2702] specifies functional requirements for solutions to deliver P2MP TE LSPs. For the sake of
    illustration, RSVP-TE [RFC3209] is one possible candidate traffic engineering over MPLS.
    It describes traffic engineering in some detail, and those
    definitions and objectives are equally applicable to provide
    such traffic
    engineering in a solution so as to deliver P2MP TE LSPs.

    It point-to-multipoint service environment. They are
    not repeated here, but it is intended that solutions assumed that specify procedures for
    P2MP TE LSP setup satisfy these requirements. There the reader is no intent to
    either specify solution specific details in this document or
    application specific requirements.

    It fully
    familiar with them.

    [RFC2702] also explains how MPLS is intended that particularly suited to traffic
    engineering, and presents the requirements presented in this document following eight reason.

       1. Explicit label switched paths which are not limited to constrained by
          the requirements destination based forwarding paradigm can be easily created
          through manual administrative action or through automated
          action by the underlying protocols.
       2. LSPs can potentially be efficiently maintained.
       3. Traffic trunks can be instantiated and mapped onto LSPs.
       4. A set of packet switched networks, but
    also encompass attributes can be associated with traffic trunks
          which modulate their behavioral characteristics.
       5. A set of attributes can be associated with resources which
          constrain the requirements placement of TDM, lambda LSPs and port switching
    networks managed by Generalized traffic trunks across
          them.
       6. MPLS (GMPLS) protocols. Protocol
    solutions developed to meet the requirements set out in this
    document must attempt allows for both traffic aggregation and disaggregation
          whereas classical destination only based IP forwarding
          permits only aggregation.
       7. It is relatively easy to be integrate a "constraint-based routing"
          framework with MPLS.
       8. A good implementation of MPLS can offer significantly lower
          overhead than competing alternatives for Traffic Engineering.

    These points are equally applicable to MPLS and GMPLS.

    Content Distribution (CD), Interactive multi-media (IMM), point-to-multipoint
    traffic engineering. Points 1. and VPN
    multicast are applications that 7. are best supported with multicast
    capabilities. For some of them , there is a requirement to use P2MP
    TE LSPs. One possible way to map P2MP flows onto LSPs in particularly important.

    That is, the traffic flow for a MPLS
    network point-to-multipoint LSP is not
    constrained to setup multiple P2P TE LSPs, one to each of the
    required egress LSRs. This requires replicating incoming packets to
    all the P2P LSPs at the ingress LSR to accommodate multipoint
    communication. This is sub-optimal as path or paths that it places would follow during
    multicast routing or shortest path destination-based routing, but
    can be explicitly controlled through manual or automated action.

    Further, the replication
    burden explicit paths that are used may be computed using
    algorithms based on the ingress LSR a variety of constraints to produce all manner of
    tree shapes. For example, an explicit path may be cost-based
    [STEINER], shortest path, QoS-based, or may use some fair-cost QoS
    algorithm. Such computations are potentially bound to be more complex
    and hence has very poor scaling
    characteristics. It varied than anything available in the multicast forwarding
    paradigm.

    [RFC2702] also wastes bandwidth resources, memory and describes the functional capabilities required to
    fully support Traffic Engineering over MPLS (e.g. label) resources in large networks.

      1. A set of attributes associated with traffic trunks which
         collectively specify their behavioral characteristics.

      2. A set of attributes associated with resources which constrain
         the network.

    Hence, placement of traffic trunks through them. These can also be
         viewed as topology attribute constraints.

      3. A "constraint-based routing" framework which is used to provide TE select
         paths for a P2MP application in an efficient manner
    (that is, with scalable impact on signaling traffic trunks subject to constraints imposed by
         items 1) and protocol state) in 2) above. The constraint-based routing framework
         does not have to be part of MPLS. However, the two need to be
         tightly integrated together.

    These basic requirements also should be supported by
    point-to-multipoint traffic engineering.

    This document presents a large-scale environment, P2MP TE mechanisms are required
    specifically set of requirements for
    Point-to-Multipoint(P2MP) Traffic Engineering (TE) extensions to support
    Multiprotocol Label Switching (MPLS). It specifies functional
    requirements for solutions to deliver P2MP TE LSPs. As For the sake of now, existing MPLS TE
    mechanisms
    illustration, RSVP-TE [RFC3209] is one possible candidate to provide
    such a solution so as [RFC3209] do not support to deliver P2MP TE LSPs so new
    mechanisms must be developed.

    This should be achieved without requiring LSPs.

    It is intended that solutions that specify procedures for P2MP TE LSP
    setup satisfy these requirements. There is no intent to either
    specify solution specific details in this document or application
    specific requirements.

    It is intended that the use of a multicast
    routing protocol requirements presented in this document are
    not limited to the network core, and with maximum re-use requirements of packet switched networks, but
    also encompass the
    existing MPLS protocols: in particular, requirements of TDM, lambda and port switching
    networks managed by Generalized MPLS Traffic
    Engineering. That is, (GMPLS) protocols. Protocol
    solutions developed to meet the separation between routing and signaling
    that exists requirements set out in the P2P TE network should be maintained within the
    P2MP TE network, and the construction of the TEDB from which P2MP TE
    LSP paths are computed should not be constrained this
    document must attempt to use a multicast
    protocol.

    A P2MP TE LSP will be set up with TE constraints equally applicable to MPLS and will allow
    efficient packet or data replication at various branching points in
    the network. Note GMPLS.

    Content Distribution (CD), Interactive multi-media (IMM), and VPN
    multicast are applications that the notion are best supported with multicast
    capabilities. For some of "efficient" packet replication them , there is relative and may have different meanings depending on the
    objectives (see section 5.2).

    For instance, RSVP-TE could be used for setting up a requirement to use P2MP

    TE LSP
    with enhancements LSPs. One possible way to existing P2P TE LSP procedures. map P2MP TE LSP flows onto LSPs in a MPLS
    network is to setup mechanisms MUST include the ability to add/remove
    receivers to/from an existing P2MP TE LSP.

    Note that with existing multicast routing mechanisms, multicast
    traffic cannot currently benefit from P2P TE LSPs. Hence, Call
    Admission Control for multiple P2P TE LSP cannot take into account LSPs, one to each of the
    bandwidth used for multicast traffic. P2MP TE will allow
    required egress LSRs. This requires replicating incoming packets to
    all the
    bandwidth used by both P2P LSPs at the unicast and multicast traffics ingress LSR to be
    counted by means of CAC. accommodate multipoint
    communication. This document is organized sub-optimal as follows: Section 2 provides a set of
    definitions used throughout it places the document. The problem statement is
    then discussed replication
    burden on the ingress LSR and hence has very poor scaling
    characteristics. It also wastes bandwidth resources, memory and
    MPLS (e.g. label) resources in Section 3. for the sake of illustration, this
    document lists various applications that could make use P2MP network.

    Hence, to provide TE
    LSP. Detailed application-specific requirements as far as for a P2MP application in an efficient manner
    (that is, with scalable impact on signaling and protocol state) in
    a large-scale environment, P2MP TE LSP is concerned mechanisms are out of the scope of this document.
    Detailed requirements for the required
    specifically to support of applications that require P2MP TE LSPs. As of now, existing MPLS TE
    mechanisms such as [RFC3209] do not support P2MP TE LSPs are described so new
    mechanisms must be developed.

    This should be achieved without requiring the use of a multicast
    routing protocol in section 4.

    The requirement for Multipoint-to-Point the network core, and Multipoint-to-Multipoint
    TE LSPs are outside with maximum re-use of the scope of this document.

2. Definitions

2.1 Acronyms

    P2P:

       Point-to-point

    P2MP:

       Point-to-multipoint

2.2 Terminology

    The reader is assumed to be familiar with the terminology
    existing MPLS protocols: in
    [RFC3031] particular, MPLS Traffic
    Engineering. That is, the separation between routing and [RFC3209].

    P2MP TE LSP:

       A traffic engineered label switched path signaling
    that has one unique
       ingress LSR (also referred to as exists in the root) and one or more
       egress LSRs (also referred to as P2P TE network should be maintained within the leaf).
    P2MP tree:

       The ordered set of LSRs TE network, and links that comprise the path construction of a the TEDB from which P2MP TE
    LSP from its ingress LSR paths are computed should not be constrained to all of its egress LSRs.

    sub-P2MP tree:

       A sub-P2MP tree is a portion of use a multicast
    protocol.

    A P2MP tree starting TE LSP will be set up with TE constraints and will allow
    efficient packet or data replication at
       a particular LSR that is a member of various branching points in
    the P2MP tree and includes
       ALL downstream LSRs network. Note that are also members of the P2MP tree.

    P2P sub-LSP:

       The path from the ingress LSR to a particular egress LSR.

    ingress LSR:

       The LSR that notion of "efficient" packet replication
    is responsible for initiating relative and may have different meanings depending on the signaling
       messages that set
    objectives (see section 5.2).

    For instance, RSVP-TE could be used for setting up the a P2MP TE LSP.

    egress LSR:

       One of potentially many destinations of LSP
    with enhancements to existing P2P TE LSP procedures.

    P2MP TE LSP setup mechanisms MUST include the ability to add/remove
    receivers to/from an existing P2MP TE LSP.
       Egress LSRs may also be referred to as leaf nodes or leaves.

    bud LSR:

      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

    Note that is already a member of with existing multicast routing mechanisms, multicast
    traffic cannot currently benefit from P2P TE LSPs. Hence, Call
    Admission Control for P2P TE LSP cannot take into account the
    bandwidth used for multicast traffic. P2MP tree TE will allow the
    bandwidth used by both the unicast and is in
       process multicast traffics to be
    counted by means of signaling a new sub-P2MP tree.

    prune LSR:

       An LSR that CAC.

    This document is organized as follows: Section 2 provides a member set of
    definitions used throughout the P2MP tree and document. The problem statement is
    then discussed in
       process Section 3. for the sake of tearing down an existing sub-P2MP tree.

    P2MP-ID (Pid):

       The ID illustration, this
    document lists various applications that can be used to map a set of P2P sub-LSPs to a
       particular could make use P2MP TE
    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 Detailed application-specific requirements as described in [RFC2119].

3. Problem Statement

3.1 Motivation

    Content Distribution (CD), Interactive multi-media (IMM), and VPN
    multicast far as P2MP TE LSP
    is concerned are out of the scope of this document.
    Detailed requirements for the support of applications that are best supported with multicast
    capabilities.

    IP Multicast provides require
    P2MP communication. However, there MPLS TE LSPs are no
    Traffic Engineering (TE) capabilities or QoS guarantees with
    existing IP multicast protocols. Note that Diff-serv
    (see [RFC2475],[RFC2597] and [RFC3246]) combined with IP multicast
    routing may not be sufficient for P2MP applications for many of the
    same reasons that it is not sufficient described in section 4.

    The requirement for unicast applications.
    Note also that multicast trees provided by existing IP multicast
    routing protocols are not optimal from a bandwidth usage
    perspective, which may lead to significant bandwidth wasting.

    TE and Constraint Based Routing, including Call Admission
    Control(CAC), explicit source routing and bandwidth reservation, is
    required to enable efficient resource usage Multipoint-to-Point and strict QoS
    guarantees.

    Furthermore there are no existing P2MP mechanisms for carrying layer
    2 or SONET/SDH multicast traffic over MPLS. Multipoint-to-Multipoint
    TE capabilities are
    desirable for both these applications; the related set of application
    requirements LSPs are outside of the scope of this document and might
    require special pseudowire encapsulation.

    One possible solution would be document.

2. Definitions

2.1 Acronyms

    P2P:

       Point-to-point

    P2MP:

       Point-to-multipoint

2.2 Terminology

    The reader is assumed to setup multiple P2P be familiar with the terminology in
    [RFC3031] and [RFC3209].

    P2MP TE LSPs, LSP:

       A traffic engineered label switched path that has one unique
       ingress LSR (also referred to
    each of as the required root) and one or more
       egress LSRs. This requires replicating incoming
    traffic LSRs (also referred to all as the P2P LSPs at leaf).

    P2MP tree:

       The ordered set of LSRs and links that comprise the path of a
       P2MP TE LSP from its ingress LSR to accommodate
    multipoint communication. This is clearly sub-optimal as it places
    the replication burden on the all of its egress LSRs.

    ingress LSR:

       The LSR and hence has very poor
    scaling characteristics. It also wastes bandwidth resources, memory
    and MPLS(e.g. label) resources in the network.

    Hence, to provide MPLS TE [RFC2702] that is responsible for a P2MP application in an
    efficient manner (that is, with scalable impact on initiating the signaling and
    protocol state) in a large scale environment,
       messages that set up the P2MP TE mechanisms
    are required. Existing MPLS P2P TE mechanisms have to be enhanced
    to support LSP.

    egress LSR:

       One of potentially many destinations of the P2MP TE LSP.

3.2. Requirements Overview

    This document states basic requirements for the setup
       Egress LSRs may also be referred to as leaf nodes or leaves.

    bud LSR:

      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 TE
    LSPs tree and is in
       process of signaling a solution SHOULD satisfy them without requiring new sub-P2MP tree.

    prune LSR:

       An LSR that a
    multicast routing protocol is used, although such a protocol
    MUST NOT be prohibited. It is desirable to maximize member of the re-use P2MP tree and is in
       process of tearing down an existing MPLS sub-P2MP tree.

    P2MP-ID (Pid):

       A unique identifier of a P2MP TE techniques and protocols. Note LSP, that is constant for the use
       whole LSP regardless of
    MPLS forwarding to carry the multicast traffic number of branches and/or leaves.

2.2.1 Terminology for Partial LSPs

    It is convenient to sub-divide P2MP trees for functional and
    representational reasons. a tree may also be useful divided in two dimensions:

    - A division may be made along the context length of some network designs where it might the tree. For example,
      the tree may be desired to
    avoid split into two components each running some multicast routing protocol like PIM [PIM-SM] or
    BGP (which might be required for from the use
      ingress LSR to a discrete set of PIM). egress LSRs
    - A P2MP TE LSP path will tree may be computed taking into account various
    constraints such as bandwidth, affinities, required level divided at a branch LSR (or any transit LSR) to
      produce a component of
    protection and so on. The solution MUST allow for the computation
    of P2MP TE LSP paths satisfying constraints with tree that runs from the objective branch (or
      transit) LSR to all downsetram egress LSRs.

    These two methods of
    supporting various optimization criteria such as delays, bandwidth
    consumption in the network, or any other combinations.

    This document does not restrict splitting the choice of signaling protocol
    used to set up a P2MP TE LSP, but it should tree can be noted that [RFC3468]
    states
      ... the consensus reached by the Multiprotocol Label Switching
    (MPLS) Working Group within the IETF combined, so it
    is useful to focus its
    efforts on "Resource Reservation Protocol (RSVP)-TE: Extensions introduce some terminology to
    RSVP for Label-Switched Paths (LSP) Tunnels" (RFC 3209) as allow the partitioned
    trees to be clearly described.

    Use the following designations:
      Source (ingress) LSR - S
      Leaf (egress) LSR - L
      Branch LSR - B
      Transit LSR - X
    Define three terms:

      Sub-LSP
        A component of the MPLS
    signaling protocol for traffic engineering applications...

    The P2MP TE LSP setup mechanism MUST include the ability that runs from one LSR to
    add/remove egress LSRs to/from an existing another
        without (or ignoring) any branches.

      Sub-tree
        A component of the P2MP TE LSP and MUST allow
    for the support that runs from one LSR to more than
        one other LSR by branching.

      Tree
        A component of  all the TE P2MP LSP management procedures already
    defined for P2P TE LSP such as the non disruptive rerouting (the so
    called "Make before break" procedure).

    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.

    A separate document(s) will specify how runs from one LSR to build all
        downstream LSRs.

    Using these new concepts we can define any combination or split of
    the P2MP TE LSPs. tree. For example:

      S2L sub-LSP
        The usage of those solutions will be application dependent and is
    out of path from the scope of this document. However, it is a requirement that
    those solutions attempt to be applicable source to GMPLS as well as one specific leaf.

      S2L sub-tree
        The path from the source 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

    Figure 1 shows leaves.

      B2L tree
        The path from a single ingress (I-LSR1), and four egresses(E-LSR2,
    E-LSR3, E-LSR4 and E-LSR5). I-LSR1 is attached branch LSR to a traffic source all downstream leaves.

      X2X sub-LSP
        A component of the P2MP LSP that is generating traffic for a P2MP application.
    Receivers R1, R2, R3 simple path with
        no branches.

2.3 Conventions

    The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
    "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and R4 "OPTIONAL" in
    this document are attached to E-LSR2, E-LSR3 be interpreted as described in [RFC2119].

3. Problem Statement

3.1 Motivation

    Content Distribution (CD), Interactive multi-media (IMM), and
    E-LSR4.

    The following VPN
    multicast are the objectives of P2MP LSP establishment and use.

       a) A P2MP TE LSP tree which satisfies various constraints is
          pre-determined and supplied to ingress I-LSR1.

          Note applications that are best supported with multicast
    capabilities.

    IP Multicast provides P2MP communication. However, there are no assumption is made on whether the tree is provided
          to I-LSR1
    Traffic Engineering (TE) capabilities or computed by I-LSR1. QoS guarantees with
    existing IP multicast protocols. Note that the solution SHOULD
          also allow Diff-serv
    (see [RFC2475],[RFC2597] and [RFC3246]) combined with IP multicast
    routing may not be sufficient for the support P2MP applications for many of partial path the
    same reasons that it is not sufficient for unicast applications.
    Note also that multicast trees provided by means of loose
          routing.

          Typical constraints existing IP multicast
    routing protocols are not optimal from a bandwidth requirements, resource class
          affinities, fast rerouting, preemption, usage perspective,
    which may lead to mention a few of
          them. There should not be any restriction on the possibility significant bandwidth wasting.

    TE and Constraint Based Routing, including Call Admission
    Control(CAC), explicit source routing and bandwidth reservation, is
    required to support the set of constraints already defined enable efficient resource usage and strict QoS
    guarantees.

    Furthermore there are no existing P2MP mechanisms for point to
          point carrying layer
    2 or SONET/SDH multicast traffic over MPLS. TE LSPs. A new constraint may specify which LSRs should
          be used as branch points capabilities are
    desirable for both these applications; the P2MP LSR in order to take
          into account some LSR capabilities or network constraints.

       b) A P2MP TE LSP is related set up from I-LSR1 to E-LSR2, E-LSR3 and
          E-LSR4 using of application
    requirements are outside of the tree information.

       c) In scope of this case, document and might
    require special pseudowire encapsulation.

    One possible solution would be to setup multiple P2P TE LSPs, one to
    each of the branch LSR1 should replicate required egress LSRs. This requires replicating incoming
          packets or data and send them
    traffic to E-LSR3 all the P2P LSPs at the ingress LSR to accommodate
    multipoint communication. This is clearly sub-optimal as it places
    the replication burden on the ingress LSR and E-LSR4.

       d) If a new receiver (R5) expresses an interest hence has very poor
    scaling characteristics. It also wastes bandwidth resources, memory
    and MPLS(e.g. label) resources in receiving
          traffic, the network.

    Hence, to provide MPLS TE [RFC2702] for a new tree is determined P2MP application in an
    efficient manner (that is, with scalable impact on signaling and
    protocol state) in a sub-P2MP tree from
          LSR2 to E-LSR5 is grafted onto the large scale environment, P2MP tree. LSR2 becomes a
          branch LSR.

4. Examples of candidate applications that may require TE mechanisms
    are required. Existing MPLS P2P TE mechanisms have to be enhanced
    to support P2MP TE LSP LSP.

3.2. Requirements Overview

    This section describes some of document states basic requirements for the candidate applications that P2MP
    MPLS TE is applicable to.

    The purpose setup of this section is not to mandate how P2MP TE
    LSPs must and a solution SHOULD satisfy them without requiring that a
    multicast routing protocol is used, although such a protocol MUST NOT
    be prohibited. The mechanism used in certain application scenarios. Rather it is to illustrate
    some of construct the potential application scenarios so as to highlight TED from which
    the
    features and functions that any paths of P2MP solution must provide in order
    to be trees are computed is out of wide use and applicability. This section scope of this document
    although it is not meant desirable to be
    exhaustive, maximize the re-use of existing MPLS TE
    techniques and P2MP is not limited protocols. Note that the use of MPLS forwarding to
    carry the described applications.

4.1 P2MP TE LSP for IP multicast data

    One typical scenario is traffic may also be useful in the context of some
    network designs where it might be desired to use P2MP TE LSPs as P2MP tunnels carrying avoid running some
    multicast data traffic (e.g. IP mcast). In this scenario, a routing protocol like PIM [PIM-SM] or BGP (which might be
    required for the use of PIM).

    A P2MP TE LSP is established between an ingress LSR which supports IP
    multicast source path will be computed taking into account various
    constraints such as bandwidth, affinities, required level of
    protection and several egress LSRs which support several IP
    multicast receivers. A so on. The solution MUST allow for the computation
    of P2MP TE LSP is established over the network
    and IP multicast data are tunneled from an ingress LSR node to
    multiple egress leaf LSRs paths satisfying constraints with data replication at the branch LSRs objective of
    supporting various optimization criteria such as delays, bandwidth
    consumption in the network core. Figure 2 shows an example.

    Note that network, or any other combinations.

    This document does not restrict the choice of signaling protocol
    used to set up a P2MP TE LSP can LSP, but it should be established over multiple areas/ASs
    and noted that [RFC3468]
    states
      ... the egress LSRs may deliver data into an IP multicast
    network.

                              Mcast Source
                                   |
                +---------------I-LSR0----------------+
                |                  |                  |
                |                LSR0            +----E-LSR2---R2
                |               /    \          /     |
      R1---E-LSR1---LSR2-----LSR1     LSR3----LSR4----E-LSR3---R3
                |             /        \        \     |
                |            /          \        +----E-LSR4---R4
                +-------B-LSR1---------B-LSR2---------+
                +-------- / ------++------ \ ---------+
                |         |       ||                  |
      R5---E-LSR5--------LSR5     || IPmcast Network  |
                |       /  \      ||                  |
                +-E-LSR6---E-LSR7-++----MR0--MR1------+
                    |        |           |    |
                    R6       R7          R8   R9

                               Figure 2

4.2  P2MP TE backbone network for IP multicast network

    P2MP TE LSPs are applicable in a backbone network consensus reached by the Multiprotocol Label Switching
    (MPLS) Working Group within the IETF to construct or
    support a multicast network(e.g. IPmcast network). focus its efforts on
    "Resource Reservation Protocol (RSVP)-TE: Extensions to RSVP for
    Label-Switched Paths (LSP) Tunnels" (RFC 3209) as the MPLS signaling
    protocol for traffic engineering applications...

    The IP multicast access networks are interconnected by P2MP TE LSPs.
    A P2MP TE LSP is established from an ingress LSR which accommodates
    an IP multicast network that has a multicast source setup mechanism MUST include the ability to multiple
    add/remove egress LSRs which each accommodate to/from an IP multicast network.

    In this scenario, ingress/egress LSRs placed at existing P2MP TE LSP and MUST
    allow for the edge support of
    multicast network handle an IP multicast routing protocol.
    This means that all the ingress/egress LSRs exchange IP multicast
    routing messages TE LSP management procedures
    already defined for P2P TE LSP such as neighbor routers. Figure 3 shows a network
    example the non disruptive rerouting
    (the so called "Make before break" procedure).

    The computation of this scenario.

    A P2MP TE LSP trees is established from a I-LSR1 to E-LSR2, E-LSR3, E-LSR4 implementation dependent and is
    beyond the ingress/egress LSR exchanges scope of the multicast routing messages
    with each other.

    As specified in the section related to the problem statement it
    should be possible for solutions that are built with this document
    as a solution guideline.

    A separate document(s) will specify how to add/remove egress LSRs to/from
    the P2MP MPLS TE LSP. IP multicast group membership distribution
    between the egress LSRs may change frequently. This in turn may
    require a potential build P2MP MPLS TE solution, that is suitable for IP
    multicast, to handle additions/deletions LSPs.
    The usage of egress LSRs with an
    appropriate reactiveness.

    It those solutions will be application dependent and is recommended to support a message exchange mechanism on top of
    P2MP LSP setup mechanism to support multicast (S, G) Join/Leave.

    Though several schemes exist to handle this scenario, these are
    out of the scope of this document. This document only describes requirements However, it is a requirement that
    those solutions attempt to setup be applicable to GMPLS as well as to MPLS
    so that only a P2MP TE LSP.

                              Mcast single set of solutions are developed.

    Consider the following figure.

                          Source 1 (S1)
                                |
                            +-----MR-----+
                            |      |     |
                            |     MR     |
                            +------|-----+
                +---------------I-LSR1----------------+
                |              // ||| \\              |
                |             //  |||  \\             |
                |            //  |LSR|  \\            |
                |        ___//____/|_____\\____       |
                |       /  //     |||     \\   \      |
                |       | //      |||      \\  |      |
                +-----E-LSR2----E-LSR3-----E-LSR4-----+
                +---- / ---++------|------++--- \ ----+
                |    |     ||      |      ||    |     |
           R1---MR---MR    ||      MR     ||    MR__  |
                              I-LSR1
                              |   /  \   ||     /  \    ||   /  \ \MR---R8
                +--MR--MR--++----MR--MR---++--MR--MR--+   |
                              |   |
             R2----E-LSR3--LSR1   LSR2---E-LSR2--Receiver 1 (R1)
                              |   :
                   R3----E-LSR4   E-LSR5
                              |   :
                              |
                   R2   R3   :
                             R4   R5      R6   R7

                            Figure 3

4.3  Layer 2 Multicast Over MPLS

    Existing layer 2 networks offer multicast video services. These are
    typically carried using layer 2 NBMA technology such as ATM or
    layer 2 Broadcast Access technology such as Ethernet. It may be
    desirable to deliver these layer 2 multicast services over
    a converged MPLS infrastructure where P2MP TE LSPs are used instead.

    For instance, several SPs provision P2MP ATM VCs for TV/ADSL
    services. These P2MP VCs are setup between 1
    Figure 1 shows a video server single ingress (I-LSR1), and a set
    of ATM DSLAMs. Each channel four egresses(E-LSR2,
    E-LSR3, E-LSR4 and E-LSR5). I-LSR1 is carried in a distinct P2MP VC. These
    VC maybe be routed independently, or may all be nested into a unique
    PVC, connecting the video sever attached to all DSLAMs.

    Such service could benefit from a P2MP MPLS-TE control plane. An
    option traffic source
    that is to setup generating traffic for a permanent P2MP TE LSP between the video server application.
    Receivers R1, R2, R3 and all DSLAMs, that would correspond to a PVC carrying all channel
    VCs. In this case each DSLAM receives all channels, even if there
    are no receivers that R4 are registered for a given channel.
    This ensure fast zapping, but lead attached to significant bandwidth wasting. E-LSR2, E-LSR3 and
    E-LSR4.

    The following are the objectives of P2MP LSP establishment and use.

       a) A second option is to setup a distinct P2MP TE LSP per channel. If a
    client, behind a DSLAM, zaps tree which satisfies various constraints is
          pre-determined and supplied to a new channel, then ingress I-LSR1.

          Note that no assumption is made on whether the DSLAM has
    to be added tree is
          provided to I-LSR1 or computed by I-LSR1. Note that the P2MP TE LSP carrying this channel using
          solution SHOULD also allow for the support of partial path by
          means of loose routing.

          Typical constraints are bandwidth requirements, resource class
          affinities, fast rerouting, preemption, to mention a P2MP TE
    grafting procedure, if it is few of
          them. There should not be any restriction on the possibility
          to support the set of constraints already egress LSR defined for that LSP.
    Pruning procedure has point to
          point TE LSPs. A new constraint may specify which LSRs should
          be used to remove a DSLAM from as branch points for the P2MP LSR in order to take
          into account some LSR capabilities or network constraints.

       b) A P2MP TE LSP when there is no longer any client behind the DSLAM, watching set up from I-LSR1 to E-LSR2, E-LSR3 and
          E-LSR4 using the channel.

4.4 VPN multicast network tree information.

       c) In this scenario, P2MP TE LSPs could be utilized case, the branch LSR1 should replicate incoming
          packets or data and send them to construct E-LSR3 and E-LSR4.

       d) If a
    provider network which can deliver VPN multicast service(s) new receiver (R5) expresses an interest in receiving
          traffic, a new tree is determined and a sub-P2MP tree from
          LSR2 to its
    customers.

    A E-LSR5 is grafted onto the P2MP tree. LSR2 becomes a
          branch LSR.

4. Examples of candidate applications that may require P2MP TE LSP is established between all the PE routers which
    accommodate

    This section describes some of the customer private network(s) candidate applications that handle the IP
    multicast packets. Each PE router P2MP
    MPLS TE is applicable to.

    The purpose of this section is not to mandate how P2MP TE LSPs must handle a VPN instance.

    For example,
    be used in Layer3 VPNs like BGP/MPLS based IP VPNs
    [BGPMPLS-VPN], this means certain application scenarios. Rather it is to illustrate
    some of the potential application scenarios so as to highlight the
    features and functions that each PE router any P2MP solution must handle both
    private multicast VRF tables provide in order
    to be of wide use and common multicast routing applicability. This section is not meant to be
    exhaustive, and
    forwarding table.  And each PE router exchanges private multicast
    routing information between the corresponding PE routers. In case
    of high rate source, P2MP is not limited to the need for described applications.

4.1 P2MP TE LSP can be envisaged 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

    One typical scenario is flooded to the appropriate Ethernet port(s).

    An Ethernet multipoint Layer2 VPN service provided by MPLS, this
    function is achieved by switching MPLS encapsulated frames towards
    the relevant PE nodes. But if existing P2P use P2MP TE LSPs are used as P2MP tunnels carrying
    multicast data traffic (e.g. IP mcast). In this scenario, a P2MP TE
    LSP is established between PEs, any an ingress PE must duplicate the frames LSR which supports IP
    multicast source and
    send them to the corresponding PEs. This means several egress LSRs which support several IP
    multicast receivers. A P2MP TE LSP is established over the network
    and IP multicast data stream is
    flooded just are tunneled from the an ingress PE, which will waste LSR node to
    multiple egress leaf LSRs with data replication at the branch LSRs
    in the provider's network resources.

    So, for Layer core. Figure 2 VPNs that are required to support multicast traffic,
    it might be desirable shows an example.

    Note that a P2MP MPLS TE LSPs are used for LSP can be established over multiple areas/ASs
    and that the egress LSRs may deliver data
    transmission with into an appropriate layer IP multicast
    network.

                             Mcast Source
                                  |
               +---------------I-LSR0----------------+
               |                  |                  |
               |                LSR0            +----E-LSR2---R2
               |               /    \          /     |
     R1---E-LSR1---LSR2-----LSR1     LSR3----LSR4----E-LSR3---R3
               |             /        \        \     |
               |            /          \        +----E-LSR4---R4
               +-------B-LSR1---------B-LSR2---------+
               +-------- / ------++------ \ ---------+
               |         |       ||                  |
     R5---E-LSR5--------LSR5     || IPmcast Network  |
               |       /  \      ||                  |
               +-E-LSR6---E-LSR7-++----MR0--MR1------+
                   |        |           |    |
                   R6       R7          R8   R9

                              Figure 2 encapsulation technique
    (for example, pseudo wire) instead of P2P MPLS

4.2  P2MP TE LSPs, contributing backbone network for IP multicast network

    P2MP TE LSPs are applicable in turn a backbone network to savings construct or
    support a multicast network(e.g. IPmcast network).

    The IP multicast access networks are interconnected by P2MP TE LSPs.
    A P2MP TE LSP is established from an ingress LSR which accommodates
    an IP multicast network that has a multicast source to multiple
    egress LSRs which each accommodate an IP multicast network.

    In this scenario, ingress/egress LSRs placed at the edge of multicast
    network resources. handle an IP multicast routing protocol.
    This document does not set requirements for how means that the ingress/egress LSRs exchange IP multicast VPNs are
    provided, but it does set requirements for
    routing messages as neighbor routers. Figure 3 shows a network
    example of this scenario.

    A P2MP TE LSP is established from a I-LSR1 to E-LSR2, E-LSR3, E-LSR4
    and the ingress/egress LSR exchanges the multicast routing messages
    with each other.

    Though several schemes exist to handle this scenario, these are out
    of scope of this document. This document only describes requirements
    to setup a P2MP TE LSP.

                             Mcast Source
                                  |
                           +-----MR-----+
                           |      |     |
                           |     MR     |
                           +------|-----+
               +---------------I-LSR1----------------+
               |              // ||| \\              |
               |             //  |||  \\             |
               |            //  |LSR|  \\            |
               |        ___//____/|_____\\____       |
               |       /  //     |||     \\   \      |
               |       | //      |||      \\  |      |
               +-----E-LSR2----E-LSR3-----E-LSR4-----+
               +---- / ---++------|------++--- \ ----+
               |    |     ||      |      ||    |     |
          R1---MR---MR    ||      MR     ||    MR__  |
               |   /  \   ||     /  \    ||   /  \ \MR---R8
               +--MR--MR--++----MR--MR---++--MR--MR--+
                  |    |        |    |       |    |
                  R2   R3       R4   R5      R6   R7

                                 Figure 3

4.3  Layer 2 Multicast Over MPLS

    Existing layer 2 networks offer multicast video services. These are
    typically carried using layer 2 NBMA technology such as ATM or
    layer 2 Broadcast Access technology such as Ethernet. It may be
    desirable to deliver these layer 2 multicast services over
    a converged MPLS infrastructure where P2MP TE LSPs are used instead.

    For instance, several SPs provision P2MP ATM VCs for TV/ADSL
    services. These P2MP VCs are setup between a video server and a set
    of ATM DSLAMs. Each channel is carried in a distinct P2MP VC. These
    VC maybe be routed independently, or may all be nested into a unique
    PVC, connecting the video sever to all DSLAMs.

    Such service could benefit from a P2MP MPLS-TE control plane. An
    option is to setup a permanent P2MP TE LSP between the video server
    and all DSLAMs, that would correspond to a PVC carrying all channel
    VCs. In this case each DSLAM receives all channels, even if there
    are no receivers that are registered for a given channel.
    This ensure fast zapping, but lead to significant bandwidth wasting.

    A second option is to setup a distinct P2MP TE LSP per channel. If a
    client, behind a DSLAM, zaps to a new channel, then the DSLAM has
    to be added to the P2MP TE LSP carrying this channel using a P2MP TE
    grafting procedure, if it is not already egress LSR for that LSP.
    Pruning procedure has to be used to remove a DSLAM from the P2MP TE
    LSP when there is no longer any client behind the DSLAM, watching
    the channel.

4.4 VPN multicast network

    In this scenario, P2MP TE LSPs could be utilized to construct a
    provider network which can deliver VPN multicast service(s) to its
    customers. It is, however, not a requirement that VPN multicast
    services be delivered using P2MP TE LSPs.

    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
    [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. In case
    of high rate source, the need for P2MP TE LSP can be envisaged 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).

    An Ethernet multipoint Layer2 VPN service provided by MPLS, this
    function is achieved by switching MPLS encapsulated frames towards
    the relevant PE nodes. But if existing P2P TE LSPs are used as
    tunnels between PEs, any ingress PE must duplicate the frames and
    send them to the corresponding PEs. This means the data stream is
    flooded just from the ingress PE, which will waste the provider's
    network resources.

    So, for Layer 2 VPNs that are required to support multicast traffic,
    it might be desirable that P2MP MPLS TE LSPs are used for data
    transmission with an appropriate layer 2 encapsulation technique
    (for example, pseudo wire) instead of P2P MPLS TE LSPs, contributing
    in turn to savings of network resources.

    This document does not set requirements for how multicast VPNs are
    provided, but it does set requirements for the function that must be
    available in P2MP MPLS solutions. Therefore, it is not a requirement
    that multicast VPNs utilize P2MP TE LSPs, but it is a requirement
    that P2MP MPLS solutions should be capable of supporting multicast
    VPNs.

    As already pointed out, application-specific requirements are out of
    the scope of this document.

4.5 GMPLS Networks

    GMPLS currently supports only P2P TE-LSPs just like MPLS. GMPLS
    enhances MPLS to support four new classes of interfaces: Layer-2
    Switch Capable (L2SC), Time-Division Multiplex (TDM), Lambda Switch
    Capable (LSC) and Fiber-Switch Capable (FSC) in addition to Packet
    Switch Capable (PSC) already supported by MPLS. All of these
    interface classes have so far been limited to P2P TE LSPs
    (see [RFC3473] and [RFC 3471]).

    The requirement for P2MP services for non-packet switch interfaces
    is similar to that for PSC interfaces. In particular, cable
    distribution services such as video distribution are prime candidates
    to use P2MP features. Therefore, it is a requirement that reasonable
    attempts must be made to make all the features/mechanisms
    (and protocol extensions) that will be defined to provide MPLS P2MP
    TE LSPs equally applicable to P2MP PSC and non-PSC TE-LSPs. If the
    requirements of non-PSC networks over-complicate the PSC solution a
    decision may be taken to separate the solutions. This decision must
    be taken in full consultation with the MPLS and CCAMP working groups.

5. Detailed requirements for P2MP TE extensions

5.1 P2MP LSP tunnels

    The P2MP TE extensions MUST be applicable to the signaling of LSPs
    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 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
    tree.

    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 tree formation need to be applied to
    meet various QoS requirements and operational constraints.

    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 tree by specifying branch
    LSRs explicitly.

    The P2MP TE solution therefore MUST provide a means of establishing
    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 tree                        SPF P2MP tree

                 Figure 4 Examples of P2MP TE LSP topology

    One example is the Steiner P2MP tree (Cost minimum P2MP tree)
    [STEINER]. This P2MP tree is suitable for constructing a cost
    minimum P2MP tree so as to minimize the bandwidth consumption in
    the core. 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 function figure 4). This means that the LSRs must be
    available in P2MP MPLS solutions. perform
    both label swapping and popping at the same time. Therefore, it is not a requirement
    that multicast VPNs utilize the P2MP
    TE LSPs, but it is solution MUST support a requirement mechanism that P2MP MPLS solutions should be capable of supporting multicast
    VPNs.

    As already pointed out, application-specific requirements are out of
    the scope of can setup this document.

4.5 GMPLS Networks

    GMPLS currently supports only P2P TE-LSPs just like MPLS. GMPLS
    enhances MPLS to support four new classes of interfaces: Layer-2
    Switch Capable (L2SC), Time-Division Multiplex (TDM), Lambda Switch
    Capable (LSC) and Fiber-Switch Capable (FSC) in addition to Packet
    Switch Capable (PSC) already supported by MPLS. All kind of these
    interface classes have so far been limited to P2P TE LSPs
    (see [RFC3473] bud
    LSR between an ingress LSR and [RFC 3471]).

    The requirement for P2MP services for non-packet switch interfaces
    is similar to egress LSRs. Note that this includes
    constrained Steiner trees that allow for PSC interfaces. In particular, cable
    distribution services the computation of a minimal
    cost trees with some other constraints such as video distribution are prime
    candidates to use P2MP features. Therefore, it a bounded delay
    between the source and every receiver.

    Another example is a requirement that
    reasonable attempts must CSPF (Constraint Shortest Path First) P2MP
    tree. By some metric (which can be made to make all set upon any specific criteria
    like the features/mechanisms
    (and protocol extensions) that will be defined to provide MPLS delay, bandwidth, a combination of those), one can
    calculate a shortest path P2MP
    TE LSPs equally applicable to tree. This P2MP PSC and non-PSC TE-LSPs. If tree is suitable for
    carrying real time traffic.

    The solution MUST allow the
    requirements operator to make use of non-PSC networks over-complicate any tree
    computation technique. In the PSC solution former case an efficient/optimal tree
    is defined as a
    decision may be taken to separate the solutions. This decision must
    be taken minimal cost tree (Steiner tree) whereas in full consultation with the MPLS
    later case it is defined as the tree that provides shortest path
    between the source and CCAMP working
    groups.

5. Detailed requirements for P2MP TE extensions

5.1 any receiver.

    To support explicit setup of any reasonable P2MP LSP tunnels

    The tree shape, a P2MP
    TE extensions solution MUST be applicable to the signaling support some form of LSPs explicit source-based control
    of different traffic types. For example, it MUST the P2MP tree which can explicitly include particular LSRs as
    branch nodes. This can be possible used by the ingress LSR to
    signal setup the P2MP
    TE LSP.  For instance, 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 can be simply represented as a
    whole tree or by its individual branches.

5.3 Explicit Path Loose Hops and Widely Scoped Abstract Nodes

    A P2MP tunnel are
    typical examples.

    As with P2P MPLS technology [RFC3031], traffic tree 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 completely specified if all of the same required branches
    and hops between a sender and leaf LSR are indicated.

    A P2MP
    tree.

    In order to scale to tree is partially specified if only a large number subset of branches, 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 TE LSPs SHOULD tree might be identified by a unique identifier (the particularly useful in
    inter-area and inter-AS situations although P2MP ID or Pid) that is
    constant requirements for
    inter-area and inter-AS are beyond the whole LSP regardless of the number scope of branches
    and/or leaves. Therefore, this document.

    Protocol solutions SHOULD include a way to specify loose hops and
    widely scoped abstract nodes in the identification explicit source-based control
    of the P2MP session by
    its destination addresses tree as defined in the previous section. Where this
    support is not adequate.

5.2 P2MP provided, protocol solutions MUST allow downstream LSRs
    to apply further explicit routing

    Various optimizations in control to the P2MP tree formation need to be applied to
    meet various QoS requirements and operational constraints.

    Some P2MP applications may request resolve a bandwidth guaranteed
    partially specified tree into a (more) completely specified tree.

    Protocol solutions MUST allow the P2MP tree
    which satisfies end-to-end delay requirements. And some operators
    may want to set up a cost minimum be completely
    specified at the ingress where sufficient information exists to
    allow the full tree to be computed.

    In all cases, the egress nodes of the P2MP TE LSP must be fully
    specified.

    In case of a tree being computed by specifying branch some downstream LSRs
    explicitly.

    The P2MP TE (e.g. the
    case of hops specified as loose hops), the solution therefore MUST provide a means of establishing
    arbitrary P2MP trees under
    the control of an external tree
    computation process or path configuration process or dynamic tree
    computation process located on ability for 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 tree                        SPF P2MP tree

                 Figure 4 Examples LSR of the P2MP TE LSP topology

    One example is to learn the Steiner full
    P2MP tree (Cost minimum tree. Note that this requirement MAY be relaxed in some
    environments (e.g. Inter-AS) where confidentiality must be preserved.

5.4 P2MP tree)
    [STEINER]. This TE LSP establishment, teardown, and modification mechanisms

    The P2MP tree is suitable TE solution MUST support establishment, maintenance and
    teardown of P2MP TE LSPs in a scalable manner. This MUST include
    both the existence of very many LSPs at once, and the existence of
    very many destinations for constructing a cost
    minimum single P2MP LSP.

    In addition to P2MP TE LSP establishment and teardown mechanism, it
    SHOULD implement partial P2MP tree so as modification mechanism.

    For the purpose of adding sub-P2MP TE LSPs to minimize an existing P2MP TE
    LSP, the bandwidth consumption in extensions SHOULD support a grafting mechanism. For the core. 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
    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 K pruning operations do not
    cause any additional processing in nodes except along the figure 4). This means that path to
    the LSRs must
    perform grafting and pruning node and its downstream nodes. Moreover,
    both label swapping grafting and popping at pruning operations MUST not be traffic disruptive
    for the same time. Therefore, traffic currently forwarded along the P2MP tree.

5.5 Fragmentation

    The P2MP TE solution MUST support handle the situation where a mechanism that can setup this
    kind single
    protocol message cannot contain all of bud LSR between an ingress LSR and egress LSRs. Note that
    this includes constrained Steiner trees that allow for the
    computation information necessary to
    signal the establishment of a minimal cost trees with some other constraints such
    as a bounded delay between the source and every receiver.

    Another example is a CSPF (Constraint Shortest Path First) P2MP
    tree. By some metric (which can LSP. It MUST be set upon any specific criteria
    like possible to
    establish the delay, bandwidth, a combination of those), one can
    calculate a shortest path P2MP tree. LSP in these circumstances.

    This P2MP situation may arrise in either of the following circumstances.
      a. The ingress LSR cannot signal the whole tree is suitable for
    carrying real time traffic. in a single
         message.
      b. The solution MUST allow information in a message expands to be too large (or is
         discovered to be too large) at some transit node. This may
         occur because of some increase in the operator information that needs
         to make use be signaled or because of any tree
    computation technique. In the former case an efficient/optimal tree
    is defined as a minimal cost tree (Steiner tree) whereas reduction in the
    later case size of
         signaling message that is supported.

    The solution to these problems SHOULD NOT rely on IP fragmentation,
    it is defined as RECOMMENDED to rely on some protocol procedures specific to
    the tree signaling solution.

    It is NOT RECOMMENDED that provides shortest path
    between the source and any receiver.

    To support explicit setup of fragmented protocol messages are
    re-combined at any reasonable P2MP tree shape, a P2MP
    TE solution MUST support some form of explicit source-based control
    of the P2MP tree which can explicitly include particular LSRs as
    branch nodes. This can be used by the ingress LSR downstream LSR.

5.6 Failure Reporting and Error Recovery

    Failure events may cause egress nodes or sub-P2MP LSPs to setup become
    detached from the P2MP TE LSP.  For instance, a P2MP TE LSP can These events MUST be simply represented reported
    upstream as for a
    whole tree or by its individual branches.

5.3 Explicit Path Loose Hops P2P LSP.

    The solution SHOULD provide recovery techniques such as protection
    and Widely Scoped Abstract Nodes

    A P2MP tree is completely specified if all restoration allowing recovery of the required branches
    and hops between a sender and leaf LSR are indicated.

    A P2MP tree is partially specified if only any impacted sub-P2MP TE
    LSPs. In particular, 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 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 tree might TE LSPs should or should not
    be particularly useful shared with P2P TE LSPs backup paths.

    Note that the functions specified in
    inter-area and inter-AS situations although P2MP requirements for
    inter-area and inter-AS [FRR] are beyond the scope of this document.

    Protocol solutions SHOULD include a way currently specific to specify loose hops
    packet environments and
    widely scoped abstract nodes do not apply to non-packet environments.
    Thus, while solutions MUST provide fast protection mechanisms
    similar to those specified in [FRR], this requirement is limited to
    the explicit source-based control subset of the P2MP tree solution space that applies to packet switched
    networks only.

    Note that other application-specific requirement documents may
    introduce even more stringent requirement such as defined in non packet loss,
    at the previous section. Where this cost of some increased bandwidth consumption.

    The solution SHOULD also support is provided, protocol solutions the ability to meet other network
    recovery requirements such as bandwidth protection and bounded
    propagation delay increase along the backup path during failure.

    A P2MP TE solution MUST allow downstream LSRs support P2MP fast protection mechanism to apply further explicit control
    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 tree TE LSP.
    That is, while some egress nodes remain connected to resolve a
    partially specified tree into a (more) completely specified tree.

    Protocol solutions MUST allow the P2MP tree to
    it should be completely
    specified a matter of local policy at the ingress where sufficient information exists to
    allow whether the full tree to be computed.

    In
    P2MP LSP is retained.

    When all cases, the egress nodes downstream of a branch node have become
    disconnected from the P2MP TE LSP must be fully
    specified.

    In case tree, and the some branch node is unable
    to restore connectivity to any of a tree being computed them by means of some recovery or
    protection mechanisms, the branch node MAY remove itself from the
    P2MP tree provided that it is not also an egress LSR. Since the
    faults that severed the various downstream LSRs (e.g. egress nodes from the
    case of hops specified as loose hops),
    P2MP tree may be disparate, the solution branch node MUST provide report all such
    errors to its upstream neighbor. The ingress node can then decide
    to re-compute the ability 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 trees to restore them after
    failures. In the ingress LSR 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.23.

5.7 Record route of P2MP TE LSP tunnels

    Being able to learn identify the full established topology of P2MP tree. Note that this requirement MAY be relaxed in TE LSP is
    very important for various purposes such as management and operation
    of some
    environments (e.g. Inter-AS) where confidentiality must local recovery mechanisms like Fast Reroute [FRR]. A network
    operator uses this information to manage P2MP TE LSPs. Therefore,
    topology information MUST be preserved.

5.4 collected and updated after P2MP TE LSP establishment, teardown,
    establishment and modification mechanisms process.

    The P2MP TE solution MUST support establishment, maintenance and
    teardown of P2MP TE LSPs in a scalable manner. This MUST include
    both the existence of very many LSPs at once, mechanism which can collect and the existence of
    very many destinations for a single
    update P2MP LSP.

    In addition to tree topology information after P2MP TE LSP establishment
    and teardown mechanism, it
    SHOULD implement partial P2MP tree modification mechanism. process. For example, the purpose of adding sub-P2MP TE LSPs to an existing P2MP P2P MPLS TE
    LSP, the extensions SHOULD support a grafting mechanism. For the
    purpose mechanism of deleting a sub-P2MP TE LSPs from an existing P2MP TE LSP,
    route recording could be extended and used if RSVP-TE was used as
    the extensions SHOULD support a pruning mechanism. P2MP signaling protocol.

    It is RECOMMENDED that these grafting and pruning operations do not
    cause any additional processing in nodes except along the path to information is collected in a data format
    by which the grafting and pruning sender node and its downstream nodes. Moreover,
    both grafting and pruning operations MUST not be traffic disruptive
    for the traffic currently forwarded along can recognize the P2MP tree.

5.5 Fragmentation tree topology
    without involving some complicated data calculation process.

    The P2MP TE solution MUST handle the situation where a single
   protocol message cannot contain all of the information necessary to
   signal the establishment of the P2MP LSP. It MUST be possible to
   establish the LSP in these circumstances.

   This situation may arrise in either of the following circumstances.
     a. The ingress LSR cannot signal the whole tree in a single
        message.
     b. The information in a message expands to be too large (or support the recording of both outgoing interfaces
    and node-id [NODE-ID].

5.8 Call Admission Control (CAC) and QoS Control mechanism
     of P2MP TE LSPs
    P2MP TE LSPs may share network resource with P2P TE LSPs. Therefore
    it is
        discovered important to be too large) at some transit node. This may
        occur because of some increase use CAC and QoS in the information that needs
        to same way as P2P TE LSPs
    for easy and scalable operation.

    In particular, it should be signaled or highlighted that because Multicast
    traffic cannot make use of a reduction in the size of
        signaling message that is supported.

5.6 Failure Reporting and Error Recovery

    Failure events may cause egress nodes or sub-P2MP P2P TE LSP, multicast traffic cannot be
    easily taken into account by P2P TE LSPs to become
    detached from 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 LSP. These events solutions MUST be reported
    upstream as for a P2P LSP.

    The solution SHOULD provide recovery techniques such as protection support both resource sharing and restoration allowing recovery of any impacted sub-P2MP exclusive
    resource utilization to facilitate co-existence with other LSPs to
    the same destination(s).

    P2MP TE
    LSPs. In particular, a solution MUST provide fast protection
    mechanisms be applicable to DiffServ-enabled networks
    that can provide consistent QoS control in P2MP TE LSP similar to traffic.

    Any solution SHOULD also satisfy the solutions
    specified in [FRR] for DS-TE requirements [RFC3564]
    and interoperate smoothly with current P2P TE LSPs. DS-TE protocol
    specifications.

    Note also that no this requirement document does not make any assumption is
    made on whether backup paths
    the type of bandwidth pool used for P2MP TE LSPs should or should not which can either be
    shared with P2P TE LSPs backup paths.

    Note that other application-specific requirement documents may
    introduce even more stringent requirement such as non packet loss,
    at the cost LSP or be dedicated for P2MP use.

5.9 Variation of some increased bandwidth consumption.

    The solution SHOULD also support the ability LSP Parameters

    Various parameters to meet other network
    recovery requirements such an LSP (such as bandwidth protection and bounded
    propagation delay increase priority, bandwidth, etc.) are
    signaled along each branch of the backup path during failure.

    A P2MP TE LSP.

    Any solution MUST support NOT allow for variance of these parameters. That
    is,
    - no attributes set and signaled by the ingress of a P2MP fast protection mechanism LSP may be
      varied by downstream LSRs
    - there MUST be homogenous QoS from the root to
    handle all leaves.

    THIS IS A PROVISIONAL REQUIREMENT STILL OPEN FOR DISCUSSION.

5.10 Re-optimization of P2MP applications sensitive to traffic disruption. TE LSPs

    The report detection of a more optimal path (for example, one with a lower
    overall cost) 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 failure common parts between the old and new LSP) thorough the use
    of delivery resource sharing.

    Make-before-break MUST be supported for a P2MP TE LSP to fewer than ensure that
    there is minimal traffic disruption when the P2MP TE LSP is
    re-routed.

    It is possible to achieve make-before-break that only applies to a
    sub-P2MP tree without impacting the data on all of the
    egress nodes other parts
    of the P2MP tree.

    The solution SHOULD NOT cause automatic teardown allow for make-before-break re-optimization of
    any subdivision of the P2MP TE LSP.

    That is, while some egress nodes remain connected to LSP (S2L sub-tree, S2X sub-LSP, S2L
    sub-LSP, X2L sub-tree, B2L sub-tree, X2L tree, or B2L tree) with no
    impact on the P2MP tree
    it should be a matter rest of local policy at the ingress whether the P2MP LSP is retained.

    When all egress nodes downstream of a branch node (no label reallocation, no change
    in identifiers, etc.).

    The solution SHOULD also provide the ability for the ingress LSR to
    have become
    disconnected from a strict control on the P2MP tree, and re-optimization process.
    Such re-optimization MAY be initiated by the some sub-tree root branch
    node is unable
    to restore connectivity to any of them by means of some recovery or
    protection mechanisms, (that is, the branch node MAY remove itself from setup a new sub-tree, then splice
    traffic on the
    P2MP tree provided that it is not also an egress LSR. Since new subtree and delete the
    faults that severed former sub-tree).

    THE REQUIREMENT FOR RE-OPTIMIZATION BY SUB-TREE ROOT BRANCH IS
    STILL OPEN FOR DISCUSSION

5.11 Tree Remerge

    It is possible for a single transit LSR to receive multiple
    signaling messages for the various downstream egress nodes same P2MP LSP but for different
    sets of desinations. These messages may be received from the
    P2MP tree
    same or different upstream nodes and may need to be disparate, passed on
    to the branch node MUST report all such
    errors same or different downstream nodes.

    This situation may arise as the result of the signaling solution
    definition or implementation options within the signaling
    solution. Further, it may happen during make-before-break
    reoptimization (section 5.9), or as a result of signaling
    message fragmentation (section 5.5).

    It is even possible that it is necessary to its construct distinct
    upstream neighbor. The ingress node can then decide branches in order to re-compute achieve the correct label choices
    in certain switching technologies managed by GMPLS (for example,
    photonic cross-connects where the path to those selection of a particular egress nodes, around
    lambda for the
    failure point.

    Solutions MAY include downstream branches is only available on differnt
    upstream switches).

    The solution MUST handle the facility case where multiple signaling
    messages for the same P2MP LSP are received at a single transit LSRs and particularly
    branch nodes to recompute sub-P2MP trees to restore them after
    failures. In
    LSR with the event end result of successful repair, error notifications
    SHOULD NOT be reported all receivers being added to upstream nodes, but the new paths are
    reported if route recording is in use. Crankback requirements are
    discussed in Section 5.18.

5.7 Record route of
    P2MP TE LSP tunnels

    Being able LSP.

    THIS REQUIREMENT IS STILL UNDER DISCUSSION

5.12 Data Duplication

    Data duplication refers to identify the established topology receipt by any recipient of P2MP TE LSP is
    very important for various purposes such as management and operation duplicate
    instances of some local recovery mechanisms like Fast Reroute [FRR]. A network
    operator uses the data. In a packet environment this information to manage P2MP TE LSPs. Therefore,
    topology information MUST means the
    receipt of duplicate packets - although this should be collected and updated after P2MP TE LSP
    establishment and modification process.

    The P2MP TE solution MUST support a mechanism which can collect and
    update P2MP tree topology information after P2MP LSP establishment benign (if
    inefficient) situation, it may be catastrophic in certain existing
    and modification process. For example, deployed applications. In a non-packet environment this means
    the P2P MPLS TE mechanism duplication in time of some part of
    route recording could be extended and used if RSVP-TE was used as the P2MP signaling protocol.

    It is RECOMMENDED signal that may lead to
    the information replication of data or to the scrambling of data.

    Data duplication may legitimately arrise in various scenarios
    including re-optimization of active LSPs as described in the
    previous section, and protection of LSPs. Thus, it is collected impractical to
    regulate against data duplication in this document.

    Instead, the solution MUST provide a mechanism to resolve, limit or
    avoid data format
    by duplication at either or both of:
    - the point at which the sender node can recognize data path diverges
    - the point at which the P2MP tree topology
    without involving some complicated data calculation process.

    The paths converge.

    THE EXTENT TO WHICH DATA DUPLICATION MAY BE TOLERATED (in time or in
    a count of bits or packets) IS FOR FURTHER STUDY.

5.13 IPv4/IPv6 support

    Any P2MP TE solution MUST support the recording of both outgoing interfaces
    and node-id [NODE-ID].

5.8 Call Admission Control (CAC) be equally applicable to IPv4 and QoS Control mechanism
     of IPv6.

5.14 P2MP TE LSPs MPLS Label

    A P2MP TE LSPs may share network resource with solution MUST support establishment of both P2P TE LSPs. Therefore
    it is important to use CAC and QoS in the same way as P2P P2MP
    TE LSPs
    for easy and scalable operation.

    In particular, it should be highlighted that because Multicast
    traffic cannot make use MUST NOT impede the operation 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 solutions MUST support both resource sharing and exclusive
    resource utilization to facilitate co-existence with other LSPs to within the
    same destination(s). network. A P2MP TE solution MUST be applicable to DiffServ-enabled networks
    that can provide consistent QoS control specified in such a way
    that it allows P2MP LSP traffic.

    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 TE LSPs to be signaled on the type of bandwidth pool used same
    interface. Labels for P2MP TE LSPs which can either be
    shared with and P2P TE LSP or LSPs MAY be assigned
    from shared or dedicated for label space(s). Label space shareability is
    implementation specific.

5.15 Routing advertisement of P2MP use.

5.9 Reoptimization capability

    Several high-level requirements have been identified to determine
    the capabilities of LSRs within a P2MP TE LSP network. The detection aim of such
    information is to facilitate the computation of P2MP trees using TE
    constraints within a more optimal path (for example, one network that contains LSRs that do not all have
    the same capabilities levels with a lower
    overall cost) is respect to P2MP signaling and data
    forwarding.

    These capabilities include, but are not limited to:

    - the ability of an example LSR to support branching.
    - the ability of an LSR to act as an egress and a situation where branch for the
      same LSP.
    - the ability of an LSR to support P2MP TE LSP
    re-routing MPLS-TE signalling.

    It is expected that it may be required. While re-routing is in progress, an
    important requirement is avoiding double bandwidth reservation
    (over the common parts between appropriate to gather this information
    through extensions to TE IGPs (see [RFC3630] and [IS-IS-TE]), but
    the old precise requirements and new LSP) thorough mechanisms are out of the use scope of resource sharing.

    Make-before-break MUST be supported for this
    document. It is expected that a separate document will cover this
    requirement.

5.16 Multi-Area/AS LSP

    P2MP TE LSP to ensure that
    there is no traffic disruption when the solutions SHOULD support multi-area/AS P2MP TE LSP is re-routed.
    For example, LSPs.

    The precise requirements in support of multi-area/AS P2MP TE LSPs is
    out of the P2P scope of this document. It is expected that a separate
    document will cover this requirement.

5.17 Multi-access LANs

    P2MP MPLS TE make-before-break mechanism could may be
    extended and used if RSVP-TE was used to traverse network segments that are
    provided by multi-access media such as the P2MP signaling protocol.

    It Ethernet. In these cases, it
    is also possible to achieve make-before-break that only applies the entry point to the network segment is a
    sub-P2MP tree without impacting
    branch point of the P2MP LSP.

    Two options clearly exist:

     - the branch point replicates the data on all of and transmits multiple
       copies onto the other parts
    of segment
     - the P2MP tree.

    The solution SHOULD allow for make-before-break reoptimization of branch point sends a
    sub-tree with no impact single copy of the data to the segment
       and relies on the rest exit points to discriminate the reception of
       the tree (no label
    reallocation, no change in identifiers, etc.). data.

    The first option has a significant scaling issue since all
    replicated data must be sent through the same port and carried on
    the same segment. Thus, a solution SHOULD also provide the ability a mechanism 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 (that is, the
    branch node MAY setup to send a new sub-tree, then splice
    traffic on single copy of the new subtree data onto a multi-access
    network and delete the former sub-tree).

5.10 IPv4/IPv6 support

    Any reach multiple (adjacent) downstrem nodes.

5.18 P2MP TE solution MPLS OAM

    Management of P2MP LSPs is as important as the management of P2P
    LSPs.

    The MPLS and GMPLS MIB modules MUST be equally applicable enhanced to IPv4 and IPv6.

5.11 provide P2MP MPLS Label

    A TE
    LSP management.

    In order to facilitate correct management, P2MP TE LSPs MUST have
    unique identifiers.

    OAM facilities will have special demands in P2MP TE solution MUST support establishment environments
    especially within the context of both P2P tracing the paths and connectivity
    of P2MP TE LSPs LSPs. The precise requirements and MUST NOT impede the operation mechanisms for OAM are
    out of P2P TE LSPs within the
    same network. A scope of this document. It is expected that a separate
    document will cover these requirements.

5.19 Scalability

    Scalability is a key requirement in P2MP TE solution MPLS systems. Solutions
    MUST be specified in such a way
    that it allows P2MP and P2P TE LSPs designed to be signaled on scale well with an increase in the same
    interface. Labels for P2MP TE LSPs number of any
    of the following:

    - the number of recipients
    - the number of branch points
    - the number of branches.

    Both scalability of performance and P2P TE LSPs MAY operation MUST be assigned
    from shared or dedicated label space(s). Label space shareability is
    implementation specific.

5.12 Routing advertisement considered.

    Key considerations SHOULD include:
    - the amount of refresh processing associated with maintaining
      a P2MP capability

    Several high-level requirements have been identified to determine TE LSP.
    - the capabilities amount of protocol state that must be maintained by ingress
      and transit LSRs within along a P2MP network. The aim tree.
    - the number of such
    information is protocol messages required to facilitate set up or tear down a
      P2MP LSP as a function of the computation number of P2MP trees using TE
    constraints within egress LSRs.
    - the number of protocol messages required to repair a network that contains LSRs that do not all have P2MP LSP
      after failure or perform make-before-break.
    - the same capabilities levels with respect amount of protocol information transmitted to manage
      a P2MP signaling and data
    forwarding.

    These capabilities include, but are not limited to: TE LSP (i.e. the message size).
    - the ability amount of an LSR to support branching. potential routing extensions.
    - the ability amount of an LSR to act as an egress control plane processing required by the ingress,
      transit and egress LSRs to add/delete a branch for the
      same LSP.
    - the ability of LSP to/from an LSR to support
      existing P2MP MPLS-TE signalling. LSP.

    It is expected that it may the applicability of each solution will be appropriate
    evaluated with regards to gather this information
    through extensions the aforementioned scalability criteria.

5.19.1 Absolute Limits

    THIS IS SECTION DESCRIBES PROVISIONAL REQUIREMENTS STILL OPEN FOR
    DISCUSSION.

    In order to TE IGPs (see [RFC3630] and [IS-IS-TE]), but achieve the precise requirements and mechanisms are out of best solution for the scope of this
    document. It problem space it is expected that a separate document will cover this
    requirement.

5.13 Multi-Area/AS LSP

    P2MP TE solutions SHOULD support multi-area/AS
    helpful to clarify the boundaries for P2MP TE LSPs.

    The precise requirements in support

    - Number of multi-area/AS recipients.
      A P2MP TE LSPs is
    out of LSP MUST reduce to similar scaling properties as a P2P
      LSP when the scope number of this document. recipients reduces to one.
      It is expected that important to classify the problem as a separate
    document will cover this requirement.

5.14 P2MP MPLS OAM

    Management Traffic Engineering
      problem. It is anticipated that the initial deployments of P2MP TE
      LSPs may be limited to only several hundred recipients, but also
      that future deployments may require significantly larger numbers.
      An acceptable solution, therefore, is as important as one that scales linearly
      with the management number of P2P
    LSPs.

    The MPLS and GMPLS MIB modules recipients.

      Solutions that scale worse than linear (that is, exponential or
      polynomial) are not acceptable whatever the number of recipients
      they could support

    - Number of branch points.
      Solutions MUST be enhanced support all possiblities from one extreme of a
      single branch point that forks to provide P2MP TE
    LSP management.

    In order all leaves on a separate branch,
      to facilitate correct management, P2MP TE LSPs MUST have
    unique identifiers.

    OAM facilities will have special demands in P2MP environments
    especially within the context greatest number of tracing branch points which is (n-1) for n
      recipients. Assumptions MUST NOT be made in the paths solution regarding
      which topology is more common, and connectivity the solution MUST be designed
      to ensure scalability in all topologies.

    - Dynamics of P2MP TE LSPs. The precise requirements and tree.
      Recall that the mechanisms for OAM determining which recipients should
      be added to an LSP, and for adding and removing recipients from
      that group are out of the scope of this document. It Nevertheless, it
      is useful to understand the expected rates of arrival and
      departure of recipients since this can impact the selection of
      solution techniques.
      Again, it must be recall that a separate this document will cover these requirements.

5.15 Scalability

    Scalability is a key requirement in P2MP MPLS systems. Solutions
    MUST be designed limited to scale well with an increase Traffic
      Engineering, and in this model the number rate of any change of recipients
      may be expected to be lower than in an IP multicast group.
      Although the following:

    - the absolute number of recipients
    - coming and going is the number of branch points
    -
      important element for determining the number of branches.

    Both scalability of performance and operation MUST a solution,
      it may be considered.

    Key considerations SHOULD include:
    - the amount of refresh processing associated noted that a percentage may be a more comprehensible
      measure but that this is not as significant for LSPs with maintaining a small
      number of recipients.
      A working figure for an established P2MP TE LSP is less than 10%
      churn per day. That is, a relatively slow rate of churn.
      We could say that a P2MP LSP would be shared by multiple multicast
      groups and dynamics of P2MP LSP would be relatively small.
      Considering applicability that P2MP LSP to use L2 multi-access
      path technology, we can consider stable P2MP TE LSP.
    - L2 path even when we
      transfer IP multicast traffic over the amount path.

      Solutions MUST optimize around such relatively low rates of protocol state that must be maintained by ingress change
      and transit LSRs along a P2MP tree. are NOT REQUIRED to optimize for significantly higher rates
      of change.

    - the number Rate of protocol messages required change within the network.
      It is also important to set up or tear down a
      P2MP LSP as a function of understand the number of egress LSRs.
    - scaling with regard to
      changes within the number network. That is, one of protocol messages required to repair a P2MP LSP
      after failure or perform make-before-break.
    - the amount features 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 is that it can be robust or protected against network
      failures, and egress LSRs can be re-optimized to add/delete a branch LSP to/from an
      existing P2MP LSP. take advantage of newly
      available network resources.

      It is expected more important that the applicability of each a solution will be
    evaluated optimized for scaling with regards
      respect to recovery and re-optimization of the aforementioned scalability criteria.

5.16 LSP, than for change
      in the recipients, because P2MP is used as a TE tool.
      The solution MUST follow this distinction.

5.20 Backwards Compatibility

    It SHOULD be an aim of any P2MP solution to offer as much backward
    compatibility as possible. An ideal which is probably impossible to

    achieve 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
    nodes as both transit non-branch LSRs and egress LSRs.

    It is a further requirement for the solution that any LSR 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
    through a P2MP network.

    Also, it is a requirement that P2MP TE LSPs MUST be able to co-exist
    with IP unicast and IP multicast networks.

5.17

5.21 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 the
    other features of GMPLS including:

    - control and data plane separation (IF_ID RSVP_HOP and IF_ID
      ERROR_SPEC),
    - full support of numbered and unnumbered TE links (see [RFC 3477]
      and [GMPLS-ROUTE]),
    - use of the GENERALIZED_LABEL_REQUEST, the GENERALIZED_LABEL
      (C-Type 2 and 3), the SUGGESTED_LABEL and the RECOVERY_LABEL,
      in conjunction with the LABEL_SET and the ACCEPTABLE_LABEL_SET
      object,
    - 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.
    - E2E and Segment Recovery procedures.
    - support of Graceful Restart

    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 be emphasized that path computation and management
    techniques shall be as close as possible to those being used for
    PSC P2P TE LSPs and P2MP TE LSPs.

5.18

5.22 Requirements for Hierarchical P2MP TE LSPs

    [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<PSC2<PSC3<PSC4<L2SC<TDM<LSC<FSC).

    Particularly it SHOULD allow a Region i P2MP TE LSP to be nested
    into a region j P2MP TE LSP or multiple region j P2P TE LSPs,
    providing that i<j.

    The precise requirements and mechanisms for this function are out of
    the scope of this document. It is expected that a separate document
    will cover these requirements.

5.19

5.23 P2MP Crankback routing

    P2MP solutions SHOULD support crankback requirements as defined in
    [CRANKBACK]. In particular, they SHOULD provide sufficient
    information to a branch LSR from downstream LSRs to allow the branch
    LSR to re-route a sub-tree around any failures or problems in the
    network.

6. Security Considerations
    This requirements document does not define any protocol extensions
    and does not, therefore, make any changes to any security models.

    It should be noted that P2MP signaling mechanisms built on P2P
    RSVP-TE signaling are likely to inherit all of the security
    techniques and problems associated with RSVP-TE. These problems may
    be exacerbated in P2MP situations where security relationships may
    need to maintained between an ingress and multiple egresses. Such
    issues are similar to security issues for IP multicast.

    It is a requirement that documents offering solutions for P2MP LSPs
    MUST have detailed security sections.

7. Acknowledgements

    The authors would like to thank George Swallow, Ichiro Inoue, Dean
    Cheng, Lou Berger and Eric Rosen for their review and suggestions.

8. References

8.1 Normative References

    [RFC2119]     Bradner, S., "Key words for use in RFCs to Indicate
                  Requirement Levels", BCP 14, RFC 2119, March 1997.

    [RFC2475]     Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z.
                  and W. Weiss,  "An Architecture for Differentiated
                  Services", RFC 2475, December 1998.

    [RFC2597]     Heinanen, J., Baker, F., Weiss, W. and J. Wroclawski,
                  "Assured Forwarding PHB Group", RFC 2597, June 1999.

    [RFC2702]     D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J.
                  McManus, "Requirements for Traffic Engineering Over
                  MPLS", RFC2702, September 1999.

    [RFC3031]     Rosen, E., Viswanathan, A. and R. Callon,
                  "Multiprotocol Label Switching Architecture", RFC 3031,
                  January 2001.

    [RFC3209]     Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan,
                  V. and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP
                  Tunnels", RFC 3209, December 2001.

    [RFC3246]     Davie, B., Charny, A., Bennet, J.C.R., Benson, K., Le
                  Boudec, J.Y., Davari, S., Courtney, W., Firioiu, V. and
                  D. Stiliadis, "An Expedited Forwarding PHB (Per-Hop
                  Behavior)", RFC 3246, March 2002.

    [RFC3667]     Bradner, S., "IETF Rights in Contributions", BCP 78,
                  RFC 3667, February 2004.

    [RFC3668]     Bradner, S., Ed., "Intellectual Property Rights in IETF
                  Technology", BCP 79, RFC 3668, February 2004.

8.2 Informational References

    [RFC3471]     Berger, L., Editor, "Generalized Multi-Protocol Label
                  Switching (GMPLS) Signaling Functional Description",
                  RFC 3471, January 2003.

    [RFC3473]     Berger, L., Editor, "Generalized Multi-Protocol Label
                  Switching (GMPLS) Signaling - Resource ReserVation
                  Protocol-Traffic Engineering (RSVP-TE) Extensions",
                  RFC 3473, January 2003.

    [RFC3477]     K. Kompella, Y. Rekhter, "Signalling Unnumbered Links
                  in Resource ReSerVation Protocol -Traffic Engineering
                  (RSVP-TE)", RFC3477, January 2003.

    [RFC3564]     F. Le Faucheur, W. Lai, "Requirements for Support of
                  Differentiated Services-aware MPLS Traffic
                  Engineering", RFC 3564, July 2003.

    [RFC3630]     D. Katz, D. Yeung, K. Kompella, "Traffic Engineering
                  Extensions to OSPF Version 2", RFC 3630, September
                  2003.

    [PIM-SM]      B. Fenner, M. Hadley, H. Holbrook, I. Kouvelas,
                  "Protocol Independent Multicast - Sparse Mode (PIM-SM):
                  Protocol Specification (Revised)", draft-ietf-pim-sm-
                  v2-new-08.txt, October 2003.
                  v2-new-10.txt, July 2004.

    [BGPMPLS-VPN] E. Rosen, Y.Rekhter, Editor, "BGP/MPLS IP VPNs",
                  draft-ietf-l3vpn-rfc2547bis-01.txt,
                  draft-ietf-l3vpn-rfc2547bis-02.txt, September 2003. 2004.

    [GMPLS-ROUTE] K. Kompella, Y. Rekhter,  Editor, "Routing Extensions
                  in Support of Generalized Multi-Protocol Label
                  Switching", draft-ietf-ccamp-gmpls-routing-08.txt,
                  October 2003.

    [STEINER]     H. Salama, et al., "Evaluation of Multicast Routing
                  Algorithm for Real-Time Communication on High-Speed
                  Networks," IEEE Journal on Selected Area in
                  Communications, pp.332-345, 1997.

    [FRR]         P. Pan, D. Gan, G. Swallow, J. P. Vasseur, D. Cooper, A. Atlas, M. Jork,"Fast "Fast Reroute Extensions
                  to RSVP-TE for LSP Tunnels",
                  draft-ietf-mpls-rsvp-lsp-fastreroute-03.txt, July
                  2003. draft-ietf-mpls-rsvp-lsp-
                  fastreroute-07.txt, August 2004.

    [IS-IS-TE]    Henk Smit, Tony Li, "IS-IS extensions "Intermediate System to
                  Intermediate System (IS-IS) Extensions for Traffic
                  Engineering", draft-ietf-isis-traffic-04.txt, December
                  2002.
                  Engineering (TE)", RFC 3784, June 2004.

    [CRANKBACK]   A. Farrel, A. Satyanarayana, A. Iwata, N. Fujita, G.
                  Ash, S. Marshall, "Crankback Signaling Extensions for
                  MPLS Signaling", draft-ietf-ccamp-crankback-01.txt,
                  January draft-ietf-ccamp-crankback-02.txt,
                  July 2004.

    [LSP-HIER]    K. Kompella, Y. Rekhter, "LSP Hierarchy with
                  Generalized MPLS TE", draft-ietf-mpls-lsp-hierarchy-
                  08.txt, September 2002.

    [NODE-ID]     Vasseur, Ali and Sivabalan, "Definition of an RRO node-
                  id subobject", draft-ietf-mpls-nodeid-subobject-01.txt,
                  June 2003.

9. Editor's Address

    Seisho Yasukawa
    NTT Corporation
    9-11, Midori-Cho 3-Chome
    Musashino-Shi, Tokyo 180-8585,
    Japan
    Phone: +81 422 59 4769
    Email: yasukawa.seisho@lab.ntt.co.jp

10. Authors' Addresses

    Dimitri Papadimitriou
    Alcatel
    Francis Wellensplein 1,
    B-2018 Antwerpen,
    Belgium
    Phone : +32 3 240 8491
    Email: dimitri.papadimitriou@alcatel.be
    JP Vasseur
    Cisco Systems, Inc.
    300 Beaver Brook Road
    Boxborough, MA 01719,
    USA
    Email: jpv@cisco.com

    Yuji Kamite
    NTT Communications Corporation
    Tokyo Opera City Tower
    3-20-2 Nishi Shinjuku, Shinjuku-ku,
    Tokyo 163-1421,
    Japan
    Email: y.kamite@ntt.com

    Rahul Aggarwal
    Juniper Networks
    1194 North Mathilda Ave.
    Sunnyvale, CA 94089
    Email: rahul@juniper.net

    Alan Kullberg
    Motorola Computer Group
    120 Turnpike Rd.
    Southborough, MA 01772
    Email: alan.kullberg@motorola.com

    Adrian Farrel
    Old Dog Consulting
    Phone: +44 (0) 1978 860944
    Email: adrian@olddog.co.uk

    Markus Jork
    Avici Systems
    101 Billerica Avenue
    N. Billerica, MA 01862
    Phone: +1 978 964 2142
    Email: mjork@avici.com

    Andrew G. Malis
    Tellabs
    2730 Orchard Parkway
    San Jose, CA 95134
    Phone: +1 408 383 7223
    Email: andy.malis@tellabs.com
    Jean-Louis Le Roux
    France Telecom
    2, avenue Pierre-Marzin
    22307 Lannion Cedex
    France
    Email: jeanlouis.leroux@francetelecom.com

11. Intellectual Property Consideration

    The IETF takes no position regarding the validity or scope of any
    Intellectual Property Rights or other rights that might be claimed
    to pertain to the implementation or use of the technology
    described in this document or the extent to which any license
    under such rights might or might not be available; nor does it
    represent that it has made any independent effort to identify any
    such rights.  Information on the procedures with respect to rights
    in RFC documents can be found in BCP 78 and BCP 79.

    Copies of IPR disclosures made to the IETF Secretariat and any
    assurances of licenses to be made available, or the result of an
    attempt made to obtain a general license or permission for the use
    of such proprietary rights by implementers or users of this
    specification can be obtained from the IETF on-line IPR repository
    at http://www.ietf.org/ipr.

    The IETF invites any interested party to bring to its attention
    any copyrights, patents or patent applications, or other
    proprietary rights that may cover technology that may be required
    to implement this standard.  Please address the information to the
    IETF at ietf-ipr@ietf.org.

11.1 IPR Disclosure Acknowledgement

    By submitting this Internet-Draft, I certify that any applicable
    patent or other IPR claims of which I am aware have been disclosed,
    and any of which I become aware will be disclosed, in accordance
    with RFC 3668.

12. Full Copyright Statement

    Copyright (C) The Internet Society (2004).  This document is
    subject to the rights, licenses and restrictions contained in BCP
    78, and except as set forth therein, the authors retain all their
    rights.

    This document and the information contained herein are provided
    on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE
    REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND
    THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES,
    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT
    THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR
    ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A
    PARTICULAR PURPOSE.