Nokia

Ottawa Canada hooman.bidgoli@nokia.com

Bell Canada

Montreal Canada daniel.voyer@bell.ca

Cisco System

San Jose USA riparekh@cisco.com

Juniper Networks

Boston USA zzhang@juniper.net

SR P2MP policies are set of policies that enable architecture for P2MP service delivery. A P2MP Policy consists of candidate paths that connects the Root of the Tree to a set of Leaves. The P2MP policy is composed of replication segments. A replication segment is a forwarding instruction for a candidate path which is downloaded to the Root, transit nodes and the leaves. This document describes a simple and efficient mechanism that can be used to detect data plane failures in P2MP Policy Candidate Paths (CPs) and Path Instances (PIs).

Each P2MP Policy can have multiple Candidate Paths (CP)s. The CP with highest preference is the active CP while all other CPs are the backup CPs. A CP can have multiple PIs to allow global optimization of the CP via Make Before Break procedures between the active PI and the newly setup and optimized PI. It is desirable to test the end to end connectivity of a CP, whether it is the active CP or a backup CP and all the CP's PIs. This document describes a mechanism that can be used to detect data plane failures in P2MP Policy CP and its associate Path Instances (PI). This draft is only for replication SIDs that use MPLS encap for their forwarding and not SRv6. It reuses most of the concepts in

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 when, and only when, they appear in all capitals, as shown here.

A P2MP Policy and its corresponding Replication Segments are usually setup via a controller, the root and the leaves are discovered as per . The tree is calculated from the root to the leaves. There is no underlay protocol to signal the P2MP Policy from the root to the Leaf routers, as such when a P2MP tree fails to deliver user traffic, the failure can be difficult to pin point without a ping/traceroute mechanism to isolate the fault in the P2MP tree. The P2MP Policy ping/traceroute can be utilize to detect faults on the path of the tree and its associated replication segments . These tools can be used to periodically ping the leaves to ensure connectivity. If the ping fails, trace route can be initiated to determine where the failure lies. The ping/traceroute can be initiated from the node that initiates the P2MP policy.

Ping/Traceroute packets are forwarded on the P2MP Policy, on a specific CP or its active PI toward the leaf routers. They are replicated at the replication point based on the replication segment forwarding information on the corresponding node. This draft only addresses the replication segments that use MPLS encap only, future drafts will address the SRv6 forwarding. The packet are processed accordingly when their TTL expires or when the egress router (leaf) is reached. The appropriate respond is send back to the root as per procedures in This draft reuses most procedures for mLDP in RFC This draft also reuses the same destination UDP port as The implementation should take into account that there can be many CPs under the P2MP Policy and the implementation should allow each CP and its corresponding PI to be tested via Ping and Trace route. The Ping and Traceroute packet is forwarded via that specific CP and its corresponding replication segments. On the egress node the corresponding CP and its PI should respond irrespective if it is the active CP or a backup CP. Two replication segments can be connected via a unicast SR domain. In this scenario the SR tunnel labels need to be programmed with the right TTL depending on the which type of hierarchical MPLS TTL mode is used. As an example pipe vs uniform mode. When in SR domain the P2MP Tree PING and Traceroute will be processed on the two connecting replication segments based on the replication SID and its TTL. As such the SR domain will act as a single hop on the replication SID and the replication SID TTL is subtracted by one before the unicast SR SIDs are pushed on the replication SID. To detect failure in SR domain is beyond the scope of this draft.

The packet format used is as per section 3. Some new TLVs and sub-TLVs are required to support the new functionality. They are described in the following sections.

a simple and efficient mechanism to detect data-plane failures in Multiprotocol Label Switching (MPLS) Label Switched Paths (LSPs). In order to identify the correct replication segment for the CP and its PI, the echo request message MUST carry a Target FEC Stack TLV, this draft defines a new sub-TLV: a P2MP policy MPLS CP FEC Stack sub-TLV. The new sub-TLV is assigned Sub-Type identifiers (TBD), and are described in the following sections.

The format of the P2MP Policy Session sub-TLV value field is specified in the following figure. The value fields are taken from the definitions of the P2MP Policy section 3 of

Address Family: Two-octet quantity, containing a value from ADDRESS FAMILY NUMBERS in [IANA-AF] that encodes the address family for the Root Address. Address Length: Length of the Root Address in octets. Root Address: The address of Root node of P2MP tree instantiated by the SR P2MP Policy TreeId Length: Length of the TreeID in octets. This should be set to 4 octets Tree-ID: A identifier that is unique in context of the Root. This is an unsigned 32-bit number. Path-instance Length: Length of the path instance ID in octet. path-instance: path instance ID to be tested

As per section 3.2 Four sub-TLVs are used for the inclusion in the P2MP Responder Identifier TLV carried on the echo request message. The Sub-TLVs for IPv4 and IPv6 egress address P2MP responder is in par with section 3.2.1 The Sub-TLVs for IPv4 and IPv6 node address P2MP responder is in par with section 3.2.2

IANA is requested to assign a new sub-tlv (TBD) for P2MP Policy MPLS CP from the mpls-lsp-ping parameters, TLV types 1, 16 and 21 This sub-tlv should be called P2MP Policy MPLS Candidate Path.

TBD