Supporting explicit inclusion or exclusion of abstract nodes for a subset of P2MP destinations in Path Computation Element Communication Protocol (PCEP).
draft-dhody-pce-pcep-p2mp-per-destination-03

The information below is for an old version of the document
Document Type None Internet-Draft (individual)
Last updated 2013-04-14 (latest revision 2012-10-11)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Additional URLs
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Unknown state
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-dhody-pce-pcep-p2mp-per-destination-03.txt

Abstract

The ability to determine paths of point-to-multipoint (P2MP) Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering Label Switched Paths (TE LSPs) is one the key requirements for Path Computation Element (PCE). [RFC6006] and [PCE-P2MP-PROCEDURES] describes these mechanisms for intra and inter domain path computation via PCE. This document describes the need for explicitly specifying abstract nodes for inclusion or exclusion for a subset of destinations during the Point to Multipoint (P2MP) path computation via PCE. Further an extension to the PCE communication Protocol (PCEP) for P2MP is suggested to support this.

Authors

Dhruv Dhody (dhruv.dhody@huawei.com)
Udayasree Palle (udayasree.palle@huawei.com)
Venugopal Kondreddy (venugopalreddyk@huawei.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)