Skip to main content

Standard Representation Of Domain Sequence
draft-dhody-pce-pcep-domain-sequence-02

Document Type Replaced Internet-Draft (individual)
Expired & archived
Authors Dhruv Dhody , Udayasree Palle , Ramon Casellas
Last updated 2012-10-10 (Latest revision 2012-02-09)
Replaced by draft-ietf-pce-pcep-domain-sequence
RFC stream (None)
Intended RFC status (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-pce-pcep-domain-sequence
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

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

Authors

Dhruv Dhody
Udayasree Palle
Ramon Casellas

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