{
  "draft": "draft-ietf-pce-brpc-09",
  "doc_id": "RFC5441",
  "title": "A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths",
  "authors": [
    "JP. Vasseur, Ed.",
    "R. Zhang",
    "N. Bitar",
    "JL. Le Roux"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "18",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Path Computation Element",
  "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]",
  "pub_date": "April 2009",
  "keywords": [
    "te lsp",
    "path computation element"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC5441",
  "errata_url": "https://www.rfc-editor.org/errata/rfc5441"
}