draft-ietf-pce-inter-area-as-applicability-00.txt   draft-ietf-pce-inter-area-as-applicability-01.txt 
PCE Working Group D. King PCE Working Group D. King
Internet Draft Old Dog Consulting Internet Draft Old Dog Consulting
Intended status: Informational J. Meuric Intended status: Informational J. Meuric
Expires: April 18, 2011 O. Dugeon Expires: October 18, 2011 O. Dugeon
France Telecom France Telecom
Q. Zhao Q. Zhao
Huawei Technologies Huawei Technologies
Oscar Gonzalez de Dios Oscar Gonzalez de Dios
Francisco Javier Jimenex Chico Francisco Javier Jimenex Chico
Telefonica I+D Telefonica I+D
October 18, 2010 April 18, 2011
Applicability of the Path Computation Element to Inter-Area and Applicability of the Path Computation Element to Inter-Area and
Inter-AS MPLS and GMPLS Traffic Engineering Inter-AS MPLS and GMPLS Traffic Engineering
draft-ietf-pce-inter-area-as-applicability-00 draft-ietf-pce-inter-area-as-applicability-01
Abstract Abstract
The Path Computation Element (PCE) may be used for computing services The Path Computation Element (PCE) may be used for computing services
that traverse multi-area and multi-AS Multiprotocol Label Switching that traverse multi-area and multi-AS Multiprotocol Label Switching
(MPLS) and Generalized MPLS (GMPLS) Traffic Engineered (TE) networks. (MPLS) and Generalized MPLS (GMPLS) Traffic Engineered (TE) networks.
This document examines the applicability of the PCE architecture, This document examines the applicability of the PCE architecture,
protocols, and protocol extensions for computing multi-area and protocols, and protocol extensions for computing multi-area and
multi-AS paths in MPLS and GMPLS networks. multi-AS paths in MPLS and GMPLS networks.
skipping to change at page 1, line 50 skipping to change at page 1, line 50
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html http://www.ietf.org/shadow.html
This Internet-Draft will expire on April 18, 2011. This Internet-Draft will expire on October 18, 2011.
Copyright Notice Copyright Notice
Copyright (c) 2010 IETF Trust and the persons identified as the Copyright (c) 2011 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
skipping to change at page 11, line 9 skipping to change at page 11, line 9
must be impose in order to provide such information. must be impose in order to provide such information.
In particular, for both inter-area and inter-AS, the TED must be In particular, for both inter-area and inter-AS, the TED must be
populated with all boundary node information suitable to populated with all boundary node information suitable to
establish PCEP protocol with the next PCE in the path. establish PCEP protocol with the next PCE in the path.
6.3 Provisioning Techniques 6.3 Provisioning Techniques
As PCE algorithms rely on information contained in the TED, it As PCE algorithms rely on information contained in the TED, it
is possible to populate TED information by means of provisioning. In is possible to populate TED information by means of provisioning. In
this case, the operator must regularly update and store all suitable this case, the operator must regularly update and store all suitable
information in the TED in order for the PCE to correctly compute LSP. information in the TED in order for the PCE to correctly compute LSP.
Such information range from policies (e.g. avoid this LSR, or use Such information range from policies (e.g. avoid this LSR, or use
this ASBR for a specific IP prefix) up to topology information (e.g. this ASBR for a specific IP prefix) up to topology information (e.g.
AS X is reachable trough a 100 Mbit/s link on this ASBR and 30 Mbit/s AS X is reachable trough a 100 Mbit/s link on this ASBR and 30 Mbit/s
are reserved for EF traffic). Operators may choose the type and are reserved for EF traffic). Operators may choose the type and
amount of information they can use to manage their traffic engineered amount of information they can use to manage their traffic engineered
network. network.
However, some LSPs might be provisioned to link ASs or areas. In this However, some LSPs might be provisioned to link ASs or areas. In this
case, these LSP must be announced by the IGP-TE in order to case, these LSP must be announced by the IGP-TE in order to
skipping to change at page 16, line 43 skipping to change at page 16, line 43
[RFC6006] Takeda, T., Chaitou M., Le Roux, J.L., Ali Z., [RFC6006] Takeda, T., Chaitou M., Le Roux, J.L., Ali Z.,
Zhao, Q., King, D., "Extensions to the Path Computation Zhao, Q., King, D., "Extensions to the Path Computation
Element Communication Protocol (PCEP) for Element Communication Protocol (PCEP) for
Point-to-Multipoint Traffic Engineering Label Switched Point-to-Multipoint Traffic Engineering Label Switched
Paths", RFC6006, September 2010. Paths", RFC6006, September 2010.
[PCEP-P2MP-INTER-DOMAIN] Ali Z., Zhao, Q., King, D., "PCE-based [PCEP-P2MP-INTER-DOMAIN] Ali Z., Zhao, Q., King, D., "PCE-based
Computation Procedure To Compute Shortest Constrained P2MP Computation Procedure To Compute Shortest Constrained P2MP
Inter-domain Traffic Engineering Label Switched Paths", Inter-domain Traffic Engineering Label Switched Paths",
draft-zhao-pce-pcep-inter-domain-p2mp-procedures-05.txt, draft-zhao-pce-pcep-inter-domain-p2mp-procedures-07.txt,
work in progress, July, 2010. work in progress, Januaury, 2011.
11. Acknowledgements 11. Acknowledgements
The author would like to thank Adrian Farrel for his review and The author would like to thank Adrian Farrel for his review and
Meral Shirazipour for his comments. Meral Shirazipour for his comments.
12. Author's Address 12. Author's Address
Daniel King Daniel King
Old Dog Consulting Old Dog Consulting
 End of changes. 7 change blocks. 
8 lines changed or deleted 8 lines changed or added

This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/