@techreport{ietf-pim-p2mp-policy-ping-08, number = {draft-ietf-pim-p2mp-policy-ping-08}, type = {Internet-Draft}, institution = {Internet Engineering Task Force}, publisher = {Internet Engineering Task Force}, note = {Work in Progress}, url = {https://datatracker.ietf.org/doc/draft-ietf-pim-p2mp-policy-ping/08/}, author = {Hooman Bidgoli and Daniel Voyer and Rishabh Parekh and Zhaohui (Jeffrey) Zhang}, title = {{P2MP Policy Ping}}, pagetotal = 9, year = 2024, month = jul, day = 24, abstract = {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).}, }