YANG Data Model for p2mp sr policy
draft-hb-spring-sr-p2mp-policy-yang-01
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Hooman Bidgoli , Daniel Voyer , Jayant Kotalwar , Rishabh Parekh , Tarek Saad | ||
| Last updated | 2020-05-02 (Latest revision 2019-10-30) | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| 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 defines a YANG data model for SR P2MP Policy Configuration and operation.
Authors
Hooman Bidgoli
Daniel Voyer
Jayant Kotalwar
Rishabh Parekh
Tarek Saad
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)