A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths

Metadata

Publisher: IETF
Doc Type: Standard
Pages: 18
Abstract: The ability to compute shortest constrained Traffic Engineering Label Switched Paths (TE LSPs) in Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across multiple domains has been identified as a key requirement. In this context, a domain is a collection of network elements within a common sphere of address management or path computational responsibility such as an IGP area or an Autonomous Systems. This document specifies a procedure relying on the use of multiple Path Computation Elements (PCEs) to compute such inter-domain shortest constrained paths across a predetermined sequence of domains, using a backward-recursive path computation technique. This technique preserves confidentiality across domains, which is sometimes required when domains are managed by different service providers. [STANDARDS-TRACK]
Publication Date: 2009-04-01
Status Note: Proposed Standard
DOI: 10.17487/RFC5441
Link: https://doi.org/10.17487/RFC5441
Author(s): JP Vasseur
Raymond Zhang
Dr. Nabil N. Bitar
Jean-Louis Le Roux
Keyword(s): TE LSP, PCE

Latest version of IETF RFC 5441

Document Versions — IETF RFC 5441

▶ IETF RFC 5441 (2009-04-01)

THIS DOC [ACTIVE] [LATEST VERSION]

Normative Reference(s)

IETF RFC 2119 [Active*]
IETF RFC 5440 [Active*]

Bibliographic Reference(s)

Farrel, A., "Inclusion of Manageability Sections in PCE Working Group Drafts", Work in Progress, January 2009. EXTERNAL
Vasseur, J., Roux, J., and Y. Ikejiri, "A set of monitoring tools for Path Computation Element based Architecture", Work in Progress, November 2008. EXTERNAL
Bradford, R., Vasseur, J., and A. Farrel, "Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Key-Based Mechanism", Work in Progress, November 2008. EXTERNAL
IETF RFC 2702 [Active*]
IETF RFC 4105 [Active*]
IETF RFC 4216 [Active*]
IETF RFC 4655 [Active*]
IETF RFC 4726 [Active*]
IETF RFC 5088 [Active*]
IETF RFC 5089 [Active*]
IETF RFC 5152 [Active*]
IETF RFC 5316 [Superseded*]
IETF RFC 5392 [Active*]

Source Data (JSON)

Full registry record with provenance metadata. Open directly: /api/doc/RFC5441.json

Reference Tree

Explore all references and references to this document, as a navigable tree.

Open Reference Tree

Reference this Doc

Plain text (ISO 690 compliant)

Preview:

IETF RFC 5441, A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. Available at https://doi.org/10.17487/RFC5441

Snippet:

IETF RFC 5441, A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. Available at https://doi.org/10.17487/RFC5441

HTML (ISO 690 compliant)

Preview:

Snippet:

<span class="citation"><cite>IETF RFC 5441</cite>, A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. Available at <a href="https://doi.org/10.17487/RFC5441" target="_blank" rel="noopener">https://doi.org/10.17487/RFC5441</a></span>

SMPTE's HTML Pub

Preview:

IETF RFC 5441, A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths
doi: 10.17487/RFC5441
url: https://doi.org/10.17487/RFC5441

Snippet:

<li>
<cite id="bib-rfc5441">IETF RFC 5441</cite>, A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths
<span class="doi">10.17487/RFC5441</span>
</li>

Referenced By

IETF RFC 5520 [Active*]
IETF RFC 5521 [Active*]
IETF RFC 5557 [Active*]
IETF RFC 5623 [Active*]
IETF RFC 5671 [Active*]
IETF RFC 6601 [Active*]
IETF RFC 6805 [Active*]