Skip to main content

Extensions to Path Computation Element Communication Protocol (PCEP) for Hierarchical Path Computation Elements (PCE)
draft-zhang-pce-hierarchy-extensions-02

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
Authors Fatai Zhang , Quintin Zhao , Oscar Gonzalez de Dios , Ramon Casellas , Adrian Farrel
Last updated 2013-01-17 (Latest revision 2012-07-16)
Replaced by draft-ietf-pce-hierarchy-extensions, RFC 8685, RFC 8685
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

The Hierarchical Path Computation Element (H-PCE) architecture, defined in the companion framework document [I-D.ietf-pce-hierarchy- fwk], facilitates to obtain optimum end-to-end, multi-domain paths when the sequence of domains is not known in advance. Such H-PCE architecture allows the selection of an optimum domain sequence and, through the use of a hierarchical relationship between domains, derive the optimum end-to-end path. This document defines the Path Computation Element Protocol (PCEP) extensions for the purpose of implementing Hierarchical PCE procedures which are described the aforementioned document.

Authors

Fatai Zhang
Quintin Zhao
Oscar Gonzalez de Dios
Ramon Casellas
Adrian Farrel

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