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

 
Document Type Replaced Internet-Draft (individual)
Last updated 2012-10-10 (latest revision 2012-02-09)
Replaced by draft-ietf-pce-pcep-domain-sequence
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-pce-pcep-domain-sequence
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
https://www.ietf.org/archive/id/draft-dhody-pce-pcep-domain-sequence-02.txt

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 (dhruvd@huawei.com)
Udayasree Palle (Udayasreepalle@huawei.com)
Ramon Casellas (ramon.casellas@cttc.es)

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