RFC 6805: The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS
In plain English — editorial summary, not part of the RFC
Computing optimum routes for Label Switched Paths (LSPs) across multiple domains in MPLS Traffic Engineering (MPLS-TE) and GMPLS networks presents a problem because no single point of path computation is aware of all of the links and resources in each domain. A solution may be achieved using the Path Computation Element (PCE) architecture. Where the sequence of domains is known a priori, various techniques can be employed to derive an optimum path. If the domains are simply connected, or if the preferred points of interconnection are also known, the Per-Domain Path Computation technique can be used. Where there are multiple connections between domains and there is no preference for the choice of points of interconnection, the Backward-Recursive PCE-based Computation (BRPC) procedure can be used to derive an optimal path. This document examines techniques to establish the optimum path when the sequence of domains is not known in advance. The document shows how the PCE architecture can be extended to allow the optimum sequence of domains to be selected, and the optimum end-to-end path to be derived through the use of a hierarchical relationship between domains. This document is not an Internet Standards Track specification; it is published for informational purposes.
Document record
- Document ID
- RFC6805
- Published
- November 2012
- Authors
- D. King; A. Farrel
- Status
- INFORMATIONAL
- Stream
- IETF
- Area
- rtg
- Pages
- 33
- Also known as
- —
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 6807Population Count Extensions to Protocol Independent Multicast (PIM)Current
December 2012
- RFC 6810The Resource Public Key Infrastructure (RPKI) to Router ProtocolUpdated
January 2013
- RFC 6811BGP Prefix Origin ValidationUpdated
January 2013
- RFC 6793BGP Support for Four-Octet Autonomous System (AS) Number SpaceCurrent
December 2012
- RFC 6790The Use of Entropy Labels in MPLS ForwardingUpdated
November 2012
- RFC 6822IS-IS Multi-InstanceObsoleted
December 2012
- RFC 6823Advertising Generic Information in IS-ISCurrent
December 2012
- RFC 6825Traffic Engineering Database Management Information Base in Support of MPLS-TE/GMPLSCurrent
January 2013
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?