BGP Extensions for Path Computation Element (PCE) Discovery
draft-dong-pce-discovery-proto-bgp-06
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Jie Dong , Mach Chen , Dhruv Dhody , Jeff Tantsura , Kenji Kumaki , Tomoki Murai | ||
| Last updated | 2017-04-30 (Latest revision 2016-10-27) | ||
| Stream | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| 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) |
https://www.ietf.org/archive/id/draft-dong-pce-discovery-proto-bgp-06.txt
Abstract
In networks where a Path Computation Element (PCE) is used for path computation, it is desirable for the Path Computation Clients (PCCs) to discover dynamically and automatically a set of PCEs along with certain information relevant for PCE selection. RFC 5088 and RFC 5089 define the PCE discovery mechanisms based on Interior Gateway Protocols (IGP). This document defines extensions to BGP for the advertisement of PCE Discovery information. The BGP based PCE discovery mechanism is complementary to the existing IGP based mechanisms.
Authors
Jie Dong
Mach Chen
Dhruv Dhody
Jeff Tantsura
Kenji Kumaki
Tomoki Murai
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)