P2MP Policy Ping
draft-ietf-pim-p2mp-policy-ping-04
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| Authors | Hooman Bidgoli , Daniel Voyer , Rishabh Parekh , Zhaohui (Jeffrey) Zhang | ||
| Last updated | 2024-04-23 (Latest revision 2023-10-21) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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).
Authors
Hooman Bidgoli
Daniel Voyer
Rishabh Parekh
Zhaohui (Jeffrey) Zhang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)