BGP Extensions for Path Computation Element (PCE) Discovery
draft-dong-pce-discovery-proto-bgp-03

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2016-03-04 (latest revision 2015-09-01)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html 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-dong-pce-discovery-proto-bgp-03.txt

Abstract

In networks where Path Computation Element (PCE) is used for centralized path computation, it is desirable for Path Computation Clients (PCCs) to automatically discover a set of PCEs and select the suitable ones to establish the PCEP session. RFC 5088 and RFC 5089 define the PCE discovery mechanisms based on Interior Gateway Protocols (IGP). This document describes several scenarios in which the IGP based PCE discovery mechanisms cannot be used directly. This document specifies the BGP extensions for PCE discovery in these scenarios. The BGP based PCE discovery mechanism is complementary to the existing IGP based mechanisms.

Authors

Jie Dong (jie.dong@huawei.com)
Mach Chen (mach.chen@huawei.com)
Dhruv Dhody (dhruv.ietf@gmail.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.)