PCE Working Group D. King
Internet Draft Old Dog Consulting
Intended status: Informational J. Meuric
Expires: 25 August 2013 O. Dugeon
France Telecom
Q. Zhao
Huawei Technologies
Oscar Gonzalez de Dios
Telefonica I+D
25 February 2013
Applicability of the Path Computation Element to Inter-Area and
Inter-AS MPLS and GMPLS Traffic Engineering
draft-ietf-pce-inter-area-as-applicability-03
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 to IETF in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet-
Drafts.
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."
The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html
This Internet-Draft will expire on July 22, 2013.
King, et al. [Page 1]
draft-ietf-pce-inter-area-as-applicability-03.txt February 2013
Copyright Notice
Copyright (c) 2013 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. Domains.................................................4
1.2. Path Computation........................................4
1.2.1 PCE-based Path Computation Procedure.................5
1.3. Traffic Engineering Aggregation and Abstraction.........5
1.4. Traffic Engineered Label Switched Paths.................6
1.5. Inter-area and Inter-AS Connectivity Discovery..........6
1.6. Objective Functions.....................................6
2. Terminology..................................................7
3. Issues and Considerations....................................7
3.1 Multi-homing.............................................7
3.2 Domain Confidentiality ..................................8
3.3 Destination Location.....................................8
4. Domain Topologies............................................8
4.1 Selecting Domain Paths...................................9
4.2 Multi-Homed Domains......................................9
4.3 Domain Meshes............................................9
4.4 Domain Diversity.........................................9
4.5 Synchronized Path Computations...........................9
4.6 Domain Inclusion or Exclusion............................10
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...................12
5.2. Control and Recording of Area Crossing..................12
datatracker.ietf.org