Standard Representation Of Domain Sequence

The information below is for an old version of the document
Document Type Expired Internet-Draft (pce WG)
Authors Dhruv Dhody  , Udayasree Palle  , Ramon Casellas 
Last updated 2013-01-06 (latest revision 2012-07-05)
Replaces draft-dhody-pce-pcep-domain-sequence
Stream Internet Engineering Task Force (IETF)
Expired & archived
plain text pdf htmlized bibtex
Stream WG state WG Document
Document shepherd None
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

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


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.)