<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-pim-sr-p2mp-policy" target="https://datatracker.ietf.org/doc/html/draft-ietf-pim-sr-p2mp-policy-12">
   <front>
      <title>Segment Routing Point-to-Multipoint Policy</title>
      <author initials="D." surname="Voyer" fullname="Daniel Voyer">
         <organization>Bell Canada</organization>
      </author>
      <author initials="C." surname="Filsfils" fullname="Clarence Filsfils">
         <organization>Cisco Systems, Inc.</organization>
      </author>
      <author initials="R." surname="Parekh" fullname="Rishabh Parekh (editor)">
         <organization>Arrcus</organization>
      </author>
      <author initials="H." surname="Bidgoli" fullname="Hooman Bidgoli">
         <organization>Nokia</organization>
      </author>
      <author initials="Z. J." surname="Zhang" fullname="Zhaohui (Jeffrey) Zhang">
         <organization>Juniper Networks</organization>
      </author>
      <date month="May" day="23" year="2025" />
      <abstract>
	 <t>   Point-to-Multipoint (P2MP) policy enables creation of P2MP trees for
   efficient multi-point packet delivery in a Segment Routing (SR)
   domain.  A SR P2MP Policy consists of Candidate Paths (CP) which
   define the topology of P2MP tree instances in each Candidate Path.  A
   P2MP tree instance is instantiated by a set of Replication segments.

   This document specifies the architecture, signaling, and procedures
   for SR P2MP Policies within Segment Routing over MPLS (SR-MPLS) and
   Segment Routing over IPv6 (SRv6) dataplane.  It defines the P2MP
   Policy construct, the roles of the root and leaf nodes, Candidate
   Paths and and how P2MP trees using Replication Segments are
   instantiated and maintained.  Additionally, it describes the required
   extensions for Path Computation Element (PCE) to support P2MP path
   computation and provisioning.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-pim-sr-p2mp-policy-12" />
   
</reference>
