Search RFCs
RFC 5441
A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths,April 2009
- File formats:
- Status:
- PROPOSED STANDARD
- Authors:
- JP. Vasseur, Ed.
R. Zhang
N. Bitar
JL. Le Roux - Stream:
- IETF
- Source:
- pce (rtg)
Cite this RFC:TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC5441
Discuss this RFC: Send questions or comments to the mailing listpce@ietf.org
Other actions:View Errata | Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 5441
Abstract
The ability to compute shortest constrained Traffic Engineering LabelSwitched Paths (TE LSPs) in Multiprotocol Label Switching (MPLS) andGeneralized MPLS (GMPLS) networks across multiple domains has beenidentified as a key requirement. In this context, a domain is acollection of network elements within a common sphere of addressmanagement or path computational responsibility such as an IGP areaor an Autonomous Systems. This document specifies a procedurerelying on the use of multiple Path Computation Elements (PCEs) tocompute such inter-domain shortest constrained paths across apredetermined sequence of domains, using a backward-recursive pathcomputation technique. This technique preserves confidentialityacross domains, which is sometimes required when domains are managedby different service providers. [STANDARDS-TRACK]
For the definition ofStatus,seeRFC 2026.
For the definition ofStream, seeRFC 8729.