PCE Communication Protocol (PCECP) specific requirements for Inter-Area (G)MPLS Traffic Engineering
draft-leroux-pce-pcecp-interarea-reqs-00
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Author | Jean-Louis Le Roux | ||
| Last updated | 2011-10-04 (Latest revision 2005-10-17) | ||
| Replaced by | RFC 5376 | ||
| Stream | (None) | ||
| Intended RFC status | (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 | Replaced by draft-ietf-pce-interas-pcecp-reqs | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-leroux-pce-pcecp-interarea-reqs-00.txt
Abstract
For scalability purposes a network may comprise multiple IGP areas. An inter-area TE-LSP is an LSP that transits through at least two IGP areas. In a multi-area network, topology visibility remains local to a given area, and a head-end LSR cannot compute alone an inter-area shortest constrained path. One key application of the Path Computation Element (PCE) architecture is the computation of inter- area TE-LSP paths. In this context, this document lists a detailed set of PCE Communication Protocol (PCECP) specific requirements for support of inter-area TE-LSP path computation. It complements generic requirements for a PCE Communication Protocol.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)