Standard Representation of Domain-Sequence
draft-ietf-pce-pcep-domain-sequence-09

The information below is for an old version of the document
Document Type Active Internet-Draft (pce WG)
Last updated 2015-11-16 (latest revision 2015-09-21)
Replaces draft-dhody-pce-pcep-domain-sequence
Stream IETF
Intended RFC status Experimental
Formats plain text pdf html bibtex
Stream WG state Submitted to IESG for Publication
Document shepherd Jonathan Hardwick
Shepherd write-up Show (last changed 2015-10-16)
IESG IESG state IESG Evaluation
Consensus Boilerplate Yes
Telechat date
Has enough positions to pass.
Responsible AD Deborah Brungard
Send notices to (None)
IANA IANA review state IANA OK - Actions Needed
IANA action state None
PCE Working Group                                               D. Dhody
Internet-Draft                                                  U. Palle
Intended status: Experimental                        Huawei Technologies
Expires: March 23, 2016                                      R. Casellas
                                                                    CTTC
                                                      September 20, 2015

               Standard Representation of Domain-Sequence
                 draft-ietf-pce-pcep-domain-sequence-09

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.  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 Interior
   Gateway Protocol (IGP) area or an Autonomous System (AS).  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 to be used by Path
   Computation Elements (PCEs) to compute inter-domain constrained
   shortest paths across a predetermined sequence of domains . This
   document also defines new subobjects to be used to encode domain
   identifiers.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on March 23, 2016.

Dhody, et al.            Expires March 23, 2016                 [Page 1]
Internet-Draft                 DOMAIN SEQ                 September 2015

Copyright Notice

   Copyright (c) 2015 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Scope . . . . . . . . . . . . . . . . . . . . . . . . . .   4
     1.2.  Requirements Language . . . . . . . . . . . . . . . . . .   4
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Detail Description  . . . . . . . . . . . . . . . . . . . . .   6
     3.1.  Domains . . . . . . . . . . . . . . . . . . . . . . . . .   6
     3.2.  Domain-Sequence . . . . . . . . . . . . . . . . . . . . .   6
     3.3.  Domain-Sequence Representation  . . . . . . . . . . . . .   7
     3.4.  Include Route Object (IRO)  . . . . . . . . . . . . . . .   7
       3.4.1.  Subobjects  . . . . . . . . . . . . . . . . . . . . .   8
         3.4.1.1.  Autonomous system . . . . . . . . . . . . . . . .   8
         3.4.1.2.  IGP Area  . . . . . . . . . . . . . . . . . . . .   9
       3.4.2.  Update in IRO specification . . . . . . . . . . . . .  10
       3.4.3.  IRO for Domain-Sequence . . . . . . . . . . . . . . .  10
         3.4.3.1.  PCC Procedures  . . . . . . . . . . . . . . . . .  11
         3.4.3.2.  PCE Procedures  . . . . . . . . . . . . . . . . .  11
     3.5.  Exclude Route Object (XRO)  . . . . . . . . . . . . . . .  12
       3.5.1.  Subobjects  . . . . . . . . . . . . . . . . . . . . .  12
         3.5.1.1.  Autonomous system . . . . . . . . . . . . . . . .  13
         3.5.1.2.  IGP Area  . . . . . . . . . . . . . . . . . . . .  13
     3.6.  Explicit Exclusion Route Subobject (EXRS) . . . . . . . .  15
     3.7.  Explicit Route Object (ERO) . . . . . . . . . . . . . . .  15
   4.  Examples  . . . . . . . . . . . . . . . . . . . . . . . . . .  16
     4.1.  Inter-Area Path Computation . . . . . . . . . . . . . . .  16
     4.2.  Inter-AS Path Computation . . . . . . . . . . . . . . . .  18
       4.2.1.  Example 1 . . . . . . . . . . . . . . . . . . . . . .  19
       4.2.2.  Example 2 . . . . . . . . . . . . . . . . . . . . . .  21
Show full document text