SR P2MP policy ping: MPLS Segment Routing Point-to-Multipoint (P2MP) Policy Ping
How to ping and traceroute a Segment Routing multicast tree to find where it breaks.
Bidgoli, H., Ed., Ali, Z., Zhang, Z., Budhiraja, A., and D. Voyer, "MPLS Segment Routing Point-to-Multipoint (P2MP) Policy Ping", RFC 9961, DOI 10.17487/RFC9961, April 2026, <https://www.rfc-editor.org/info/rfc9961>.
@misc{rfc9961,
series = {Request for Comments},
number = 9961,
howpublished = {RFC 9961},
publisher = {RFC Editor},
doi = {10.17487/RFC9961},
url = {https://www.rfc-editor.org/info/rfc9961},
author = {H. Bidgoli and Z. Ali and Z. Zhang and A. Budhiraja and D. Voyer},
title = {{MPLS Segment Routing Point-to-Multipoint (P2MP) Policy Ping}},
pagetotal = 9,
year = 2026,
month = apr,
} RFC text
Contents
Internet Engineering Task Force (IETF) H. Bidgoli, Ed.
Request for Comments: 9961 Nokia
Category: Standards Track Z. Ali
ISSN: 2070-1721 Cisco System
Z. Zhang
Juniper Networks
A. Budhiraja
D. Voyer
Cisco System
April 2026
MPLS Segment Routing Point-to-Multipoint (P2MP) Policy Ping
Abstract
Segment Routing (SR) Point-to-Multipoint (P2MP) Policies are used to
define and manage explicit P2MP paths within a network. These
policies are typically calculated via a controller-based mechanism
and installed via, e.g., a Path Computation Element (PCE). In other
cases, these policies can be installed using the Network
Configuration Protocol (NETCONF) / YANG or a Command Line Interface
(CLI). They are used to steer Multicast traffic along optimized
paths from a Root to a set of Leaf routers.
This document defines extensions to ping and traceroute mechanisms
for an SR P2MP Policy with MPLS encapsulation to provide Operations,
Administration, and Maintenance (OAM) capabilities. The extensions
enable operators to verify connectivity, diagnose failures, and
troubleshoot forwarding issues within SR P2MP Policy Multicast trees.
By introducing new mechanisms for detecting failures and validating
path integrity, this document enhances the operational robustness of
P2MP Multicast deployments. Additionally, it ensures that existing
MPLS and SR-based OAM tools can be effectively applied to networks
utilizing SR P2MP Policies.
Status of This Memo
This is an Internet Standards Track document.
This document is a product of the Internet Engineering Task Force
(IETF). It represents the consensus of the IETF community. It has
received public review and has been approved for publication by the
Internet Engineering Steering Group (IESG). Further information on
Internet Standards is available in Section 2 of RFC 7841.
Information about the current status of this document, any errata,
and how to provide feedback on it may be obtained at
https://www.rfc-editor.org/info/rfc9961.
Copyright Notice
Copyright (c) 2026 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Revised BSD License text as described in Section 4.e of the
Trust Legal Provisions and are provided without warranty as described
in the Revised BSD License.
Table of Contents
1. Introduction
1.1. Terminology
2. Conventions Used in This Document
3. Motivation
3.1. MPLS SR P2MP Policy Ping and Traceroute
3.1.1. Applicability of RFC 6425 to MPLS SR P2MP Policy
3.1.2. Conformance to Existing Procedures and Additional
Considerations
3.1.3. Considerations for Interworking with Unicast Paths
3.2. Packet Format and New TLVs
3.2.1. Identifying a P2MP Policy
3.2.1.1. SR MPLS P2MP Policy Tree Instance FEC Stack
Sub-TLVs
3.3. Limiting the Scope of Response
4. IANA Considerations
5. Security Considerations
6. References
6.1. Normative References
6.2. Informative References
Authors' Addresses
1. Introduction
[RFC9960] explains the concept of the SR P2MP Policy and its
candidate paths (CPs). It also explains the concept of how a CP is
selected to be the active CP. To enable seamless global
optimization, a CP may consist of multiple P2MP tree instances
(PTIs), allowing for Make-Before-Break procedures between an active
PTI and a newly established, optimized PTI. A PTI is the actual P2MP
tunnel set up from the Root to a set of Leaves via transit routers.
A PTI is identified on the Root node by the PTI's instance ID.
To ensure reliable network operation, it is essential to verify end-
to-end connectivity for both active and backup CPs, as well as all
associated PTIs. This document specifies a mechanism for detecting
data plane failures within an SR P2MP Policy CP and its associated
PTIs, enabling operators to monitor and troubleshoot Multicast path
integrity.
This specification applies exclusively to Replication Segments
(Replication-SIDs) that use MPLS encapsulation for forwarding and
does not cover Segment Routing over IPv6 (SRv6). The mechanisms
described herein build upon the concepts established in [RFC6425] for
P2MP MPLS OAM. All considerations and limitations described in
Section 6 of [RFC6425] apply to this document as well.
1.1. Terminology
The readers of this document should familiarize themselves with the
following documents and sections for terminology and details
regarding the implementation of the SR P2MP Policy.
[RFC9524], Section 1.1 defines terms specific to an SR Replication
segment and also explains the node terminology in a Multicast domain,
including the Root node, Leaf node, and Bud node.
[RFC9960], Section 1.1 defines terms and concepts specific to the SR
P2MP Policy including the CP and the PTI.
2. Conventions Used in This Document
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
"OPTIONAL" in this document are to be interpreted as described in
BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
capitals, as shown here.
3. Motivation
An SR P2MP Policy and its corresponding Replication segments are
typically provisioned via a centralized controller or configured
using NETCONF/YANG or CLI. The Root and the Leaves are discovered in
accordance with [RFC9960], and the Multicast tree is computed from
the Root to the Leaves. However, there is no underlay signaling
protocol to distribute the SR P2MP Policy from the Root to the Leaf
routers. Consequently, when a P2MP tree fails to deliver user
traffic, identifying the failure can be challenging without ping and
traceroute mechanisms to isolate faults along the tree.
To address this challenge, SR P2MP Policy ping and traceroute can be
utilized to detect and localize faults within the P2MP tree and its
associated Replication segments, as defined in [RFC9524]. These OAM
tools enable periodic ping operations to verify connectivity between
the Root and the Leaves. In cases where a ping fails, a traceroute
can be initiated to determine the point of failure along the tree.
This diagnostic process can be initiated from the node responsible
for establishing the SR P2MP Policy, ensuring proactive monitoring
and fault detection.
3.1. MPLS SR P2MP Policy Ping and Traceroute
Ping/traceroute packets are forwarded based upon the SR P2MP Policy
on a specific CP and its PTI toward the designated Leaf routers.
These packets are replicated at the replication point based on the
Replication segment forwarding information on the corresponding
router.
MPLS packets are processed based on the standard behavior when their
Time to Live (TTL) expires or when they reach the egress (Leaf)
router. The appropriate response is sent back to the Root node
following the procedures outlined in [RFC6425].
3.1.1. Applicability of RFC 6425 to MPLS SR P2MP Policy
The procedures in [RFC6425] define fault detection and isolation
mechanisms for P2MP MPLS Label Switched Paths (LSPs) and extend the
LSP ping techniques described in [RFC8029] such that they may be
applied to P2MP MPLS LSPs, ensuring alignment with existing fault
management tools. [RFC6425] emphasizes the reuse of existing LSP
ping mechanisms designed for Point-to-Point (P2P) LSPs, adapting them
to P2MP MPLS LSPs to facilitate seamless implementation and network
operation.
The fault detection procedures specified in [RFC6425] are applicable
to all P2MP MPLS protocols, including P2MP RSVP-TE and Multicast LDP
and now the SR P2MP Policy. While [RFC6425] highlights specific
differences for P2MP RSVP-TE and Multicast LDP, this document
introduces considerations unique to SR P2MP Policies, including:
1. Egress Address P2MP Responder sub-TLVs: Multicast LDP, as per
Section 3.2.1 of [RFC6425], does not allow for the inclusion of
Egress Address P2MP Responder sub-TLVs, as upstream Label
Switching Routers (LSRs) lack visibility into downstream Leaf
nodes. Similarly, SR P2MP Policies often rely on a PCE for
programming transit routers. This is why in the SR P2MP domain,
transit routers do not have knowledge of the Leaf nodes. Only
the Root node, where the SR P2MP Policy is programmed, has
visibility into the Leaf nodes. Consequently, these sub-TLVs
SHOULD NOT be used when an echo request carries an SR P2MP Policy
MPLS CP Forwarding Equivalence Class (FEC). If a node receives
the Egress Address P2MP Responder sub-TLVs in an echo request,
then it will not respond since it is unaware of whether it lies
on the path to the address in the sub-TLV.
2. End of processing for traceroutes: As per Section 4.3.1 of
[RFC6425], it is RECOMMENDED that traceroute orations provide for
a configurable upper limit on TTL values. This is because, for
some protocols like Multicast LDP, there may not be an easy way
to figure out the end of the traceroute processing, as the
initiating LSR might not always know about all of the Leaf
routers. In the case of an SR P2MP Policy, the Root node has
visibility of the Leaf nodes; as such, there is a definitive way
to estimate the end of processing for a traceroute, and a
configurable upper limit on TTL may not be necessary. However, a
configurable upper limit on the TTL value is an implementation
choice.
3. Identification of the LSP under test: Section 3.1 of [RFC6425]
defines distinct identifiers for P2MP RSVP-TE and Multicast LDP
when identifying an LSP under test. As each protocol has its own
identifier, this document introduces a new Target FEC Stack TLV
specific to SR P2MP Policies to uniquely identify their CPs and
PTIs. These modifications ensure that SR P2MP Policy OAM
mechanisms are properly aligned with existing MPLS ping and
traceroute tools while addressing the specific operational
characteristics of SR P2MP Policies.
3.1.2. Conformance to Existing Procedures and Additional Considerations
In addition to major differences outlined in the previous section, SR
P2MP Policies SHOULD follow the common procedures specified in
[RFC6425] for P2MP MPLS LSPs. Furthermore, this specification reuses
the same destination UDP port as defined in [RFC8029] for consistency
with the existing MPLS OAM mechanism.
Implementations MUST account for the fact that an SR P2MP Policy may
contain multiple CPs, and each CP may consist of multiple PTIs. As
such, implementations SHOULD support the ability to individually test
each CP and its corresponding PTI using ping and traceroute
mechanisms. The ping and traceroute packets are forwarded along the
specified CP and its PTI, traversing the associated Replication
segments. When a downstream node capable of understanding the
Replication-SID receives a ping or traceroute packet, it MUST process
the request and generate a response even if the CP and its PTI are
not currently the active path.
3.1.3. Considerations for Interworking with Unicast Paths
As per [RFC9960], there are two ways to build a P2MP tree:
1. P2MP tree with non-adjacent Replication segments
2. P2MP tree with adjacent Replication segments
For the case of adjacent Replication segments, there are no special
considerations for the TTL or Hop Limit propagation, and the TTL
should be decremented hop by hop as the OAM packet traverses the
Replication segments of a P2MP tree.
For the case of non-adjacent Replication segments (for example, two
Replication segments that are connected via an SR Policy or similar
technology), there are special considerations. In such scenarios, SR
P2MP Policy OAM tools should be used to verify the connectivity of
the non-adjacent Replication segments that are building the P2MP
tree, while the unicast OAM tools should be used to verify the
connectivity of the unicast path connecting the two non-adjacent
Replication segments. In these scenarios, the Replication-SID should
not be exposed or examined in the unicast path. Proper TTL handling
to copy the Replication segment TTL to the unicast path can be
achieved via the hierarchical MPLS TTL mode being used (e.g., Pipe
Mode vs. Uniform Mode) as per [RFC3270]. For the P2MP tree
traceroute, the TTL mode MUST be set to Pipe Mode on the router that
the unicast path starts. This will ensure that the unicast path TTL
is set to a large value that allows the traceroute packet to be
delivered to the downstream Replication segment. For ping, either
the Pipe Mode or the Uniform Mode can be used depending on the
implementation. The unicast path failure detection is considered out
of scope for this document.
3.2. Packet Format and New TLVs
The packet format used in this specification follows Section 3 of
[RFC8029]. However, additional TLVs and sub-TLVs are required to
support the new functionality introduced for SR P2MP Policies. These
extensions are described in the following sections.
3.2.1. Identifying a P2MP Policy
[RFC8029] defines a standardized mechanism for detecting data plane
failures in MPLS LSPs. To correctly identify the Replication segment
associated with a given CP and PTI, the echo request message MUST
include a Target FEC Stack TLV that explicitly specifies the CP and
PTI under test.
This document introduces a new sub-TLV, referred to as the SR MPLS
P2MP Policy Tree Instance sub-TLV, which is defined as follows:
+==========+==========+===================================+
| Sub-Type | Length | Value Field |
+==========+==========+===================================+
| 41 | Variable | SR MPLS P2MP Policy Tree Instance |
+----------+----------+-----------------------------------+
Table 1
Further details regarding the structure and processing of this sub-
TLV are provided in subsequent sections.
3.2.1.1. SR MPLS P2MP Policy Tree Instance FEC Stack Sub-TLVs
The SR MPLS P2MP Policy Tree Instance sub-TLV value field follows the
format specified in Section 2.3 of [RFC9960]. The structure of this
sub-TLV is illustrated in the figure below. It should be noted that
this sub-TLV is testing a specific PTI within a specific CP and it is
not testing the CP.
0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Address Family | Address Length| Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| |
~ Root ~
| |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Tree-ID |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Instance-ID |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Address Family: 2 octets. IPv4/IPv6 Address Family Numbers as
specified in [IANA-AF], indicating the Address Family of the Root.
Any other Address Family, except IPv4/IPv6, is not supported by
this document.
Address Length: 1 octet. Specifies the length of the Root Address
in octets (4 octets for IPv4, and 16 octets for IPv6).
Reserved: MUST be set to zero by the sender and should be ignored by
the receiver.
Root: Variable length depending on the Address Family field. The
Root node of the SR P2MP Policy, as defined in [RFC9960].
Tree-ID: 4 octets. A unique identifier for the P2MP tree, as
defined in [RFC9960].
Instance-ID: 2 octets. Identifies the specific Path-Instance, as
defined in [RFC9960].
3.3. Limiting the Scope of Response
As specified in Section 3.2 of [RFC6425], four sub-TLVs are used
within the P2MP Responder Identifier TLV that is included in the echo
request message.
The sub-TLVs for IPv4 and IPv6 egress addresses of the P2MP responder
are aligned with Section 3.2.1 of [RFC6425].
The sub-TLVs for IPv4 and IPv6 node addresses of the P2MP responder
are aligned with Section 3.2.2 of [RFC6425].
These mechanisms ensure that responses are appropriately scoped to
limit unnecessary processing and improve the efficiency of P2MP OAM
procedures.
4. IANA Considerations
IANA has assigned a sub-type value for the SR MPLS P2MP Policy Tree
Instance sub-TLV in the "Sub-TLVs for TLV Types 1, 16, and 21"
registry under the "Multiprotocol Label Switching (MPLS) Label
Switched Paths (LSPs) Ping Parameters" registry group. The sub-type
value has been assigned from the Standards Action range of 0-16383 as
shown below. Note that the sub-TLV has been assigned from Type 1
(Target FEC Stack) of the "TLVs" registry.
+==========+===================================+
| Sub-Type | Sub-TLV Name |
+==========+===================================+
| 41 | SR MPLS P2MP Policy Tree Instance |
+----------+-----------------------------------+
Table 2
5. Security Considerations
Overall, the security needs for SR P2MP Policy ping are the same as
in [RFC9960], [RFC6425], and [RFC8029]. SR P2MP Policy ping is
susceptible to the same three attack vectors as explained in
Section 5 of [RFC8029]. The same procedures and recommendations
explained in Section 5 of [RFC8029] should be taken and implemented
to mitigate these attack vectors for SR P2MP Policy ping as well.
In addition, the security considerations in Section 8 of [RFC6425]
should be followed, specifically the security recommendations from
[RFC4379], which recommend the following:
| To avoid potential Denial-of-Service attacks, it is RECOMMENDED
| that implementations regulate the LSP ping traffic going to the
| control plane. A rate limiter SHOULD be applied to the well-known
| UDP port [allocated for this service].
6. References
6.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>.
[RFC3270] Le Faucheur, F., Ed., Wu, L., Davie, B., Davari, S.,
Vaananen, P., Krishnan, R., Cheval, P., and J. Heinanen,
"Multi-Protocol Label Switching (MPLS) Support of
Differentiated Services", RFC 3270, DOI 10.17487/RFC3270,
May 2002, <https://www.rfc-editor.org/info/rfc3270>.
[RFC4379] Kompella, K. and G. Swallow, "Detecting Multi-Protocol
Label Switched (MPLS) Data Plane Failures", RFC 4379,
DOI 10.17487/RFC4379, February 2006,
<https://www.rfc-editor.org/info/rfc4379>.
[RFC6425] Saxena, S., Ed., Swallow, G., Ali, Z., Farrel, A.,
Yasukawa, S., and T. Nadeau, "Detecting Data-Plane
Failures in Point-to-Multipoint MPLS - Extensions to LSP
Ping", RFC 6425, DOI 10.17487/RFC6425, November 2011,
<https://www.rfc-editor.org/info/rfc6425>.
[RFC8029] Kompella, K., Swallow, G., Pignataro, C., Ed., Kumar, N.,
Aldrin, S., and M. Chen, "Detecting Multiprotocol Label
Switched (MPLS) Data-Plane Failures", RFC 8029,
DOI 10.17487/RFC8029, March 2017,
<https://www.rfc-editor.org/info/rfc8029>.
[RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
May 2017, <https://www.rfc-editor.org/info/rfc8174>.
[RFC9524] Voyer, D., Ed., Filsfils, C., Parekh, R., Bidgoli, H., and
Z. Zhang, "Segment Routing Replication for Multipoint
Service Delivery", RFC 9524, DOI 10.17487/RFC9524,
February 2024, <https://www.rfc-editor.org/info/rfc9524>.
[RFC9960] Parekh, R., Ed., Voyer, D., Ed., Filsfils, C., Bidgoli,
H., and Z. Zhang, "Segment Routing Point-to-Multipoint
Policy", RFC 9960, DOI 10.17487/RFC9960, April 2026,
<https://www.rfc-editor.org/info/rfc9960>.
6.2. Informative References
[IANA-AF] IANA, "Address Family Numbers",
<http://www.iana.org/assignments/address-family-numbers>.
Authors' Addresses
Hooman Bidgoli (editor)
Nokia
Ottawa
Canada
Email: hooman.bidgoli@nokia.com
Zafar Ali
Cisco System
San Jose,
United States of America
Email: zali@cisco.com
Zhaohui Zhang
Juniper Networks
Boston,
United States of America
Email: zzhang@juniper.net
Anuj Budhiraja
Cisco System
San Jose,
United States of America
Email: abudhira@cisco.com
Daniel Voyer
Cisco System
Montreal
Canada
Email: davoyer@cisco.com
AI ELI5
On this page
§1What Is Being Tested
An SR P2MP Policy (see RFC 9960) has candidate paths (CPs), and a CP may hold several P2MP tree instances (PTIs). A PTI is the actual P2MP tunnel from the Root to a set of Leaves through transit routers. Several PTIs let a network switch from an active tree to a newly optimized one with Make-Before-Break.
This RFC specifies a way to detect data plane failures in a CP and its PTIs, for both active and backup paths. It applies only to Replication Segments that use MPLS encapsulation and does not cover SRv6. It builds on RFC 6425, and all considerations and limitations in Section 6 of that RFC apply here too.
A delivery tree can have several versions of itself. This RFC says how to check any one of them to see if it works.
§3Why Ping and Traceroute Are Needed
The policy and its Replication segments are normally provisioned by a central controller or by NETCONF/YANG or CLI. The Root and Leaves are discovered as in RFC 9960 and the tree is computed from the Root to the Leaves. There is no underlay signaling protocol that distributes the policy from the Root to the Leaves, so a tree that fails to deliver user traffic is hard to diagnose without these tools.
The intended workflow is simple. Periodic pings verify connectivity between the Root and the Leaves. If a ping fails, a traceroute finds the point of failure along the tree. Both can be started from the node responsible for establishing the policy.
Nobody tells the branches of the tree where they fit, so when a branch goes quiet you need a way to poke it and see where the message stops.
§3.1Reusing the RFC 6425 Procedures
Ping and traceroute packets follow the SR P2MP Policy on a chosen CP and PTI toward the Leaves, and are replicated at each replication point using the Replication segment forwarding information. They are handled as ordinary MPLS packets when the TTL expires or they reach a Leaf, and the response goes back to the Root as RFC 6425 describes. The same destination UDP port as in RFC 8029 is reused.
Three things differ from other P2MP MPLS protocols:
- Egress Address P2MP Responder sub-TLVs SHOULD NOT be used in an echo request carrying an SR P2MP Policy FEC, because transit routers do not know the Leaf nodes. A node that receives them will not respond.
- End of traceroute: the Root knows the Leaves, so it can tell when processing is done and a configurable upper limit on TTL may not be necessary. Having one is an implementation choice.
- Identifying the path under test: a new Target FEC Stack sub-TLV is introduced for CPs and PTIs.
Implementations MUST account for multiple CPs per policy and multiple PTIs per CP, and SHOULD support testing each one individually. A downstream node that understands the Replication-SID MUST process the request and respond even when that CP and PTI are not the active path.
The old way of checking multicast roads mostly works here too. The Root already knows everyone on the tree, so it knows when the check is finished, and every version of the tree must answer even if it is not the one in use.
§3.1.3Interworking with Unicast Paths
RFC 9960 allows two ways to build a tree: with adjacent Replication segments or with non-adjacent ones. For adjacent segments there is nothing special about TTL handling, and the TTL is decremented hop by hop.
For non-adjacent segments, for example two joined by an SR Policy, the P2MP OAM tools verify the Replication segments, while unicast OAM tools verify the unicast path between them. The Replication-SID should not be exposed or examined in that unicast path. TTL handling depends on the MPLS TTL mode (Pipe or Uniform, per RFC 3270). For traceroute the TTL mode MUST be Pipe Mode on the router where the unicast path starts, so the packet can reach the downstream Replication segment. For ping, either mode may be used. Detecting failures of the unicast path itself is out of scope.
When two parts of the tree are joined by an ordinary road, you test the tree parts with this tool and the ordinary road with the ordinary tools, and you tell the traceroute not to run out of time on that road.
§3.2The Tree Instance Sub-TLV
The packet format follows Section 3 of RFC 8029. To identify the segment being tested, the echo request MUST include a Target FEC Stack TLV that names the CP and PTI. This RFC adds the SR MPLS P2MP Policy Tree Instance sub-TLV, sub-type 41, with a variable length. Its value follows Section 2.3 of RFC 9960. The sub-TLV tests one specific PTI within a CP, not the CP as a whole.
The value holds an Address Family (2 octets, IPv4 or IPv6 only), an Address Length (1 octet, 4 for IPv4 and 16 for IPv6), a Reserved octet that MUST be zero when sent and is ignored on receipt, the Root address, a 4-octet Tree-ID and a 2-octet Instance-ID.
To ask about one particular version of the tree, the message carries a name tag: who the root is, which tree it is, and which version of it.
| Field | Size | Meaning |
|---|---|---|
| Address Family | 2 octets | IPv4 or IPv6 family of the Root |
| Address Length | 1 octet | 4 for IPv4, 16 for IPv6 |
| Reserved | Not given in octets | Zero when sent, ignored on receipt |
| Root | Variable | Root node of the SR P2MP Policy |
| Tree-ID | 4 octets | Unique identifier of the P2MP tree |
| Instance-ID | 2 octets | Identifies the Path-Instance |
§4IANA Assignment
IANA assigned sub-type 41, named SR MPLS P2MP Policy Tree Instance, in the "Sub-TLVs for TLV Types 1, 16, and 21" registry under the MPLS LSPs Ping Parameters registry group. It was taken from the Standards Action range of 0-16383, and it sits under Type 1 (Target FEC Stack).
The official list of tag numbers now has an entry, number 41, for this new tag.
§5Security
The security needs are the same as in RFC 9960, RFC 6425 and RFC 8029. SR P2MP Policy ping is open to the same three attack vectors described in Section 5 of RFC 8029, and the same mitigations should be applied. The RFC also points to the advice from RFC 4379 via RFC 6425: to avoid denial-of-service attacks, implementations are RECOMMENDED to regulate LSP ping traffic going to the control plane, and a rate limiter SHOULD be applied to the well-known UDP port.
Anyone could flood a router with check messages, so routers should only answer a limited number per second.