<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ali-pce-brpc-p2mp-ext" target="https://datatracker.ietf.org/doc/html/draft-ali-pce-brpc-p2mp-ext-01">
   <front>
      <title>BRPC Extensions for Point-to-Multipoint Path Computation</title>
      <author initials="Z." surname="Ali" fullname="Zafar Ali">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="T." surname="Saad" fullname="Tarek Saad">
         <organization>Cisco Systems</organization>
      </author>
      <author initials="K." surname="Kumaki" fullname="Kenji Kumaki">
         </author>
      <date month="July" day="12" year="2009" />
      <abstract>
	 <t>The ability to compute constrained Traffic Engineering Label 

Switched Paths (TE LSPs) for point-to-multipoint (P2MP) LSPs 

in Multiprotocol Label Switching (MPLS) and Generalized MPLS 

(GMPLS) networks across multiple domains (where a domain is 

a collection of network elements within a common sphere of 

address management or path computational responsibility such 

as an IGP area or an Autonomous Systems) has been identified 

as a key requirement [PCEP-P2MP-REQ]. This document addresses 

this requirement by extending backward recursive path 

computation (BRPC) technique proposed for Point-to-Point 

(P2P) LSPs in [P2P-BRPC] for P2MP LSP path computation in a 

multiple domains network.  
 
Conventions used in this document 


In examples, &quot;C:&quot; and &quot;S:&quot; indicate lines sent by the client 

and server respectively. 


The key words &quot;MUST&quot;, &quot;MUST NOT&quot;, &quot;REQUIRED&quot;, &quot;SHALL&quot;, 

&quot;SHALL NOT&quot;, &quot;SHOULD&quot;, &quot;SHOULD NOT&quot;, &quot;RECOMMENDED&quot;, &quot;MAY&quot;, 

and &quot;OPTIONAL&quot; in this document are to be interpreted as 

described in RFC-2119 0.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ali-pce-brpc-p2mp-ext-01" />
   
</reference>
