Applicability of the Path Computation Element to Inter-Area and Inter-AS MPLS and GMPLS Traffic Engineering
draft-ietf-pce-inter-area-as-applicability-07

Document Type Active Internet-Draft (pce WG)
Last updated 2018-12-13
Replaces draft-king-pce-inter-area-as-applicability
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state In WG Last Call
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
PCE Working Group                                                D. King
Internet Draft                                        Old Dog Consulting
Intended status: Informational                                  H. Zheng
Expires: June 14, 2019                               Huawei Technologies
                                                       December 13, 2018
                                         
     Applicability of the Path Computation Element to Inter-Area and    
            Inter-AS MPLS and GMPLS Traffic Engineering            

           draft-ietf-pce-inter-area-as-applicability-07

   Abstract 

   The Path Computation Element (PCE) may be used for computing services 
   that traverse multi-area and multi-AS Multiprotocol Label Switching   
   (MPLS) and Generalized MPLS (GMPLS) Traffic Engineered (TE) networks. 

   This document examines the applicability of the PCE architecture,   
   protocols, and protocol extensions for computing multi-area and  
   multi-AS paths in MPLS and GMPLS networks.

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 https://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 June 14, 2019.

Copyright Notice

   Copyright (c) 2018 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
   (https://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

King, et al.              Expires June, 2019                  [Page 1]
Internet-Draft       Inter-Area-AS Applicability       December 2018

   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. Domains.................................................4
      1.2. Path Computation........................................4
        1.2.1 PCE-based Path Computation Procedure.................5
      1.3. Traffic Engineering Aggregation and Abstraction.........6
      1.4. Traffic Engineered Label Switched Paths.................6
      1.5. Inter-area and Inter-AS Capable PCE Discovery...........6
      1.6. Objective Functions.....................................6
   2. Terminology..................................................7
   3. Issues and Considerations....................................7
      3.1 Multi-homing.............................................7
      3.2 Domain Confidentiality ..................................4
      3.3 Destination Location.....................................4
   4. Domain Topologies............................................4
      4.1 Selecting Domain Paths...................................4
      4.2 Domain Sizes.............................................9
      4.3 Domain Diversity.........................................9
      4.4 Synchronized Path Computations...........................9
      4.5 Domain Inclusion or Exclusion............................9
   5. Applicability of the PCE to Inter-area Traffic Engineering...10
      5.1. Inter-area Routing......................................11
      5.1.1. Area Inclusion and Exclusion..........................11
      5.1.2. Strict Explicit Path and Loose Path...................11
      5.1.3. Inter-Area Diverse Path Computation...................11
   6. Applicability of the PCE to Inter-AS Traffic Engineering.....12
      6.1. Inter-AS Routing........................................12
      6.1.1. AS Inclusion and Exclusion............................12
      6.2. Inter-AS Bandwidth Guarantees...........................12
      6.3. Inter-AS Recovery.......................................13
      6.4. Inter-AS PCE Peering Policies...........................13
   7. Multi-Domain PCE Deployment..................................13
      7.1 Traffic Engineering Database.............................13
      7.1.1. Applicability of BGP-LS to PCE........................14
Show full document text