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

The information below is for an old version of the document
Document Type Expired Internet-Draft (pce WG)
Last updated 2017-03-09 (latest revision 2016-07-07)
Replaces draft-zhang-pce-hierarchy-extensions
Stream IETF
Intended RFC status Proposed Standard
Formats
Expired & archived
pdf htmlized bibtex
Reviews
Stream WG state WG Document
Document shepherd Jonathan Hardwick
IESG IESG state Expired
Consensus Boilerplate Yes
Telechat date
Responsible AD (None)
Send notices to Jonathan Hardwick <jonathan.hardwick@metaswitch.com>

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-ietf-pce-hierarchy-extensions-03.txt

Abstract

The Hierarchical Path Computation Element (H-PCE) architecture (RFC 6805), provides a mechanism to allow 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 Path Computation Element Protocol (PCEP) extensions for the purpose of implementing necessary Hierarchical PCE procedures and protocol extensions.

Authors

Fatai Zhang (zhangfatai@huawei.com)
Quintin Zhao (qzhao@huawei.com)
Oscar de Dios (ogondio@tid.es)
Ramon Casellas (ramon.casellas@cttc.es)
Daniel King (daniel@olddog.co.uk)

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