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

Document Type Expired Internet-Draft (individual)
Last updated 2017-04-30 (latest revision 2016-10-27)
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-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 (jie.dong@huawei.com)
Mach Chen (mach.chen@huawei.com)
Dhruv Dhody (dhruv.ietf@gmail.com)
Jeff Tantsura (jefftant.ietf@gmail.com)
Kenji Kumaki (ke-kumaki@kddi.com)
Tomoki Murai (murai@fnsc.co.jp)

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