Traffic Engineering Database dissemination for Hierarchical PCE scenarios
draft-lopez-pce-hpce-ted-02

Document Type Expired Internet-Draft (individual)
Authors Victor Lopez  , Oscar de Dios  , Daniel King  , Stefano Previdi  , Jeff Tantsura 
Last updated 2015-01-04 (latest revision 2014-07-03)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
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-lopez-pce-hpce-ted-02.txt

Abstract

The PCE architecture is well-defined and may be used to compute the optimal path for LSPS across domains in MPLS-TE and GMPLS networks. The Hierarchical Path Computation Element (H-PCE) [RFC6805] was developed to provide an optimal path when the sequence of domains is not known in advance. The procedure and mechanism for populating the Traffic Engineering Database (TED) with domain topology and link information used in H-PCE-based path computations is open to interpretation. This informational document describes how topology dissemination mechanisms may be used to provide TE information between Parent and Child PCEs (within the H-PCE context). In particular, it describes how BGP-LS might be used to provide inter- domain connectivity. This document is not intended to define new extensions, it demonstrates how existing procedures and mechanisms may be used.

Authors

Victor Lopez (vlopez@tid.es)
Oscar de Dios (ogondio@tid.es)
Daniel King (daniel@olddog.co.uk)
Stefano Previdi (sprevidi@cisco.com)
Jeff Tantsura (jeff.tantsura@ericsson.com)

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