BGP Extensions for Path Computation Element (PCE) Discovery
draft-dong-pce-discovery-proto-bgp-03
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Jie Dong , Mach Chen , Dhruv Dhody , Jeff Tantsura | ||
| Last updated | 2016-03-04 (Latest revision 2015-09-01) | ||
| 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
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
Mach Chen
Dhruv Dhody
Jeff Tantsura
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)