Sign in
Version 5.13.0, 2015-03-25
Report a bug

Standard Representation Of Domain Sequence

Document type: Replaced Internet-Draft (individual)
Document stream: No stream defined
Last updated: 2012-10-10 (latest revision 2012-02-09)
Intended RFC status: Unknown
Other versions: (expired, archived): plain text, pdf, html

Stream State:No stream defined
Document shepherd: No shepherd assigned

IESG State: Replaced by draft-ietf-pce-pcep-domain-sequence
Responsible AD: (None)
Send notices to: No addresses provided

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found here:


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 for P2P and P2MP scenarios. 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 standard representation and encoding of a domain sequence, which is defined as an ordered sequence of domains traversed to reach the destination domain. This document also defines new sub-objects to be used to encode domain identifiers.


Dhruv Dhody <>
Udayasree Palle <>
Ramon Casellas <>

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid)