Hierachical PCE Extensions for Inter-Domain Point-to-Multipoint Path Computation
draft-li-pce-hierarchical-pce-p2mp-path-00
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | KeJun Li | ||
Last updated | 2012-07-02 (Latest revision 2011-12-30) | ||
RFC stream | (None) | ||
Intended RFC status | (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
The hierachical Path Computation Element (PCE) architecture defined in [PCE-HIERARCHY-FWK] allows the optimum sequence of domains to be selected, and the optimum end-to-end path to be derived through the use of a hierarchical relationship between domains. This document defines the hierachical PCE (H-PCE) extensions for the purpose of implementing inter-domain P2MP Path Computation.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)