Cite this RFC:TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC7897
Discuss this RFC: Send questions or comments to the mailing listpce@ietf.org
Other actions:Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 7897
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 InteriorGateway Protocol (IGP) area or an Autonomous System (AS). Thisdocument specifies a representation and encoding of a domainsequence, which is defined as an ordered sequence of domainstraversed to reach the destination domain to be used by PathComputation Elements (PCEs) to compute inter-domain constrainedshortest paths across a predetermined sequence of domains. Thisdocument also defines new subobjects to be used to encode domainidentifiers.
For the definition ofStatus,seeRFC 2026.
For the definition ofStream, seeRFC 8729.