draft-ietf-ccamp-lsp-hierarchy-bis-07.txt   draft-ietf-ccamp-lsp-hierarchy-bis-08.txt 
Network Working Group K. Shiomoto (Ed.) Network Working Group K. Shiomoto (Ed.)
Internet Draft NTT Internet Draft NTT
Updates: 3477, 4206 A. Farrel (Ed.) Updates: 3477, 4206 A. Farrel (Ed.)
Proposed Category: Proposed Standard Old Dog Consulting Proposed Category: Proposed Standard Old Dog Consulting
Created: October 19, 2009 Created: February 27, 2010
Expires: April 19, 2010 Expires: August 27, 2010
Procedures for Dynamically Signaled Procedures for Dynamically Signaled
Hierarchical Label Switched Paths Hierarchical Label Switched Paths
draft-ietf-ccamp-lsp-hierarchy-bis-07.txt draft-ietf-ccamp-lsp-hierarchy-bis-08.txt
Abstract
Label Switched Paths (LSPs) set up in Multiprotocol Label Switching
(MPLS) or Generalized MPLS (GMPLS) networks can be used to form links
to carry traffic in those networks or in other (client) networks.
Protocol mechanisms already exist to facilitate the establishment of
such LSPs and to bundle TE links to reduce the load on routing
protocols. This document defines extensions to those mechanisms to
support identifying the use to which such LSPs are to be put and to
enable the TE link endpoints to be assigned addresses or unnumbered
identifiers during the signaling process.
The mechanisms defined in this document deprecates the technique
for the signaling of LSPs that are to be used as numbered TE links
described in RFC 4206.
Status of this Memo Status of this Memo
This Internet-Draft is submitted to IETF in full conformance with the This Internet-Draft is submitted to IETF in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 1, line 35 skipping to change at page 2, line 5
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.
Abstract Copyright Notice
Label Switched Paths (LSPs) set up in Multiprotocol Label Switching
(MPLS) or Generalized MPLS (GMPLS) networks can be used to form links
to carry traffic in those networks or in other (client) networks.
Protocol mechanisms already exist to facilitate the establishment of Copyright (c) 2010 IETF Trust and the persons identified as the
such LSPs and to bundle TE links to reduce the load on routing document authors. All rights reserved.
protocols. This document defines extensions to those mechanisms to
support identifying the use to which such LSPs are to be put and to
enable the TE link endpoints to be assigned addresses or unnumbered
identifiers during the signaling process.
The mechanisms defined in this document deprecates the technique This document is subject to BCP 78 and the IETF Trust's Legal
for the signaling of LSPs that are to be used as numbered TE links Provisions Relating to IETF Documents
described in RFC 4206. (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.
Conventions used in this document Conventions used in this document
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC2119]. document are to be interpreted as described in [RFC2119].
Table of Contents Table of Contents
1. Introduction and Problem Statement ............................. 3 1. Introduction and Problem Statement ............................. 3
1.1. Background ................................................... 4 1.1. Background ................................................... 4
1.1.1. Hierarchical LSPs .......................................... 4 1.1.1. Hierarchical LSPs .......................................... 4
1.1.2. LSP Stitching Segments ..................................... 4 1.1.2. LSP Stitching Segments ..................................... 5
1.1.3. Private Links .............................................. 5 1.1.3. Private Links .............................................. 5
1.1.4. Routing Adjacencies ........................................ 5 1.1.4. Routing Adjacencies ........................................ 5
1.1.5. Forwarding Adjacencies ..................................... 5 1.1.5. Forwarding Adjacencies ..................................... 5
1.1.6. Client/Server Networks ..................................... 5 1.1.6. Client/Server Networks ..................................... 6
1.1.7. Link Bundles ............................................... 6 1.1.7. Link Bundles ............................................... 6
1.2. Desired Function ............................................. 6 1.2. Desired Function ............................................. 6
1.3. Existing Mechanisms .......................................... 6 1.3. Existing Mechanisms .......................................... 7
1.3.1. LSP Setup .................................................. 6 1.3.1. LSP Setup .................................................. 7
1.3.2. Routing Adjacency Establishment and Link State Advertisement 6 1.3.2. Routing Adjacency Establishment and Link State Advertisement 7
1.3.3. TE Link Advertisement ...................................... 7 1.3.3. TE Link Advertisement ...................................... 7
1.3.4. Configuration and Management Techniques .................... 7 1.3.4. Configuration and Management Techniques .................... 7
1.3.5. Signaled Unnumbered FAs .................................... 7 1.3.5. Signaled Unnumbered FAs .................................... 8
1.3.6. Establishing Numbered FAs Through Signaling and Routing .... 8 1.3.6. Establishing Numbered FAs Through Signaling and Routing .... 9
1.4. Overview of Required Extensions .............................. 9 1.4. Overview of Required Extensions ............................. 10
1.4.1. Efficient Signaling of Numbered FAs ........................ 9 1.4.1. Efficient Signaling of Numbered FAs ....................... 10
1.4.2. LSPs for Use as Private Links .............................. 9 1.4.2. LSPs for Use as Private Links ............................. 10
1.4.3. Signaling an LSP For use in Another Network ............... 10 1.4.3. Signaling an LSP For use in Another Network ............... 10
1.4.4. Signaling an LSP for Use in a Link Bundle ................. 10 1.4.4. Signaling an LSP for Use in a Link Bundle ................. 10
1.4.5. Support for IPv4 and IPv6 ................................. 10 1.4.5. Support for IPv4 and IPv6 ................................. 11
1.4.6. Backward Compatibility .................................... 10 1.4.6. Backward Compatibility .................................... 11
2. Overview of Solution .......................................... 10 2. Overview of Solution .......................................... 11
2.1. Common Approach for Numbered and Unnumbered Links ........... 10 2.1. Common Approach for Numbered and Unnumbered Links ........... 11
2.2. LSP Usage Indication ........................................ 11 2.2. LSP Usage Indication ........................................ 11
2.3. IGP Instance Identification ................................. 11 2.3. IGP Instance Identification ................................. 11
2.4. Link Bundle Identification .................................. 11 2.4. Link Bundle Identification .................................. 12
2.5. Backward Compatibility ...................................... 11 2.5. Backward Compatibility ...................................... 12
3. Mechanisms and Protocol Extensions ............................ 11 3. Mechanisms and Protocol Extensions ............................ 12
3.1. LSP_TUNNEL_INTERFACE_ID Object .............................. 12 3.1. LSP_TUNNEL_INTERFACE_ID Object .............................. 12
3.1.1. Existing Definition and Usage ............................. 12 3.1.1. Existing Definition and Usage ............................. 12
3.1.2. Unnumbered Links with Action Identification ............... 12 3.1.2. Unnumbered Links with Action Identification ............... 13
3.1.3. IPv4 Numbered Links with Action Identification ............ 15 3.1.3. IPv4 Numbered Links with Action Identification ............ 15
3.1.4. IPv6 Numbered Links with Action Identification ............ 15 3.1.4. IPv6 Numbered Links with Action Identification ............ 16
3.2. Target IGP Identification TLV ............................... 16 3.2. Target IGP Identification TLV ............................... 17
3.3. Component Link Identification TLV ........................... 17 3.3. Component Link Identification TLV ........................... 19
3.3.1. Unnumbered Component Link Identification .................. 18 3.3.1. Unnumbered Component Link Identification .................. 19
3.3.2. IPv4 Numbered Component Link Identification ............... 18 3.3.2. IPv4 Numbered Component Link Identification ............... 19
3.3.3. IPv6 Numbered Component Link Identification ............... 19 3.3.3. IPv6 Numbered Component Link Identification ............... 20
3.4. Link State Advertisement .................................... 19 3.4. Link State Advertisement .................................... 20
3.5. Message Formats ............................................. 20 3.5. Message Formats ............................................. 21
3.6. Error Cases and Non-Acceptance .............................. 20 3.6. Error Cases and Non-Acceptance .............................. 22
3.7. Backward Compatibility ...................................... 22 3.7. Backward Compatibility ...................................... 23
4. Security Considerations ....................................... 23 4. Security Considerations ....................................... 24
5. IANA Considerations ........................................... 23 5. IANA Considerations ........................................... 24
5.1. New Class Types ............................................. 23 5.1. New Class Types ............................................. 24
5.2. Hierarchy Actions ........................................... 23 5.2. Hierarchy Actions ........................................... 25
5.3. New Error Codes and Error Values ............................ 24 5.3. New Error Codes and Error Values ............................ 25
6. Acknowledgements .............................................. 25 6. Acknowledgements .............................................. 26
7. References .................................................... 25 7. References .................................................... 26
7.1. Normative References ........................................ 25 7.1. Normative References ........................................ 26
7.2. Informative References ...................................... 25 7.2. Informative References ...................................... 27
8. Editors' Addresses ............................................ 27 8. Editors' Addresses ............................................ 28
9. Authors' Addresses ............................................ 27 9. Authors' Addresses ............................................ 29
1. Introduction and Problem Statement 1. Introduction and Problem Statement
Traffic Engineering (TE) links in a Multiprotocol Label Switching Traffic Engineering (TE) links in a Multiprotocol Label Switching
(MPLS) or a Generalized MPLS (GMPLS) network may be constructed from (MPLS) or a Generalized MPLS (GMPLS) network may be constructed from
Label Switched Paths (LSPs) [RFC4206]. Such LSPs are known as Label Switched Paths (LSPs) [RFC4206]. Such LSPs are known as
hierarchical LSPs (H-LSPs). hierarchical LSPs (H-LSPs).
The LSPs established in one network may be used as TE links in The LSPs established in one network may be used as TE links in
another network, and this is particularly useful when a server layer another network, and this is particularly useful when a server layer
skipping to change at page 4, line 34 skipping to change at page 4, line 50
may be stacked so that LSPs may be nested with one LSP running may be stacked so that LSPs may be nested with one LSP running
through another. This concept of H-LSPs is formalized in [RFC4206] through another. This concept of H-LSPs is formalized in [RFC4206]
with a set of protocol mechanisms for the establishment of an H-LSP with a set of protocol mechanisms for the establishment of an H-LSP
that can carry one or more other LSPs. that can carry one or more other LSPs.
[RFC4206] goes on to explain that an H-LSP may carry other LSPs only [RFC4206] goes on to explain that an H-LSP may carry other LSPs only
according to their switching types. This is a function of the way according to their switching types. This is a function of the way
labels are carried. In a packet switch capable (PSC) network, the labels are carried. In a packet switch capable (PSC) network, the
H-LSP can carry other PSC LSPs using the MPLS label stack. In non- H-LSP can carry other PSC LSPs using the MPLS label stack. In non-
packet networks where the label is implicit, label stacks are not packet networks where the label is implicit, label stacks are not
possible and rely on the ability to nest switching technologies. possible, and H-LSPs rely on the ability to nest switching
Thus, for example, a lambda switch capable (LSC) LSP can carry a time technologies. Thus, for example, a lambda switch capable (LSC) LSP
division multiplexing (TDM) LSP, but cannot carry another LSC LSP. can carry a time division multiplexing (TDM) LSP, but cannot carry
another LSC LSP.
Signaling mechanisms defined in [RFC4206] allow an H-LSP to be Signaling mechanisms defined in [RFC4206] allow an H-LSP to be
treated as a single hop in the path of another LSP (i.e., one hop of treated as a single hop in the path of another LSP (i.e., one hop of
the LSP carried by the H-LSP). This mechanism is known as "non- the LSP carried by the H-LSP). This mechanism is known as "non-
adjacent signaling." adjacent signaling."
1.1.2. LSP Stitching Segments 1.1.2. LSP Stitching Segments
LSP stitching is defined in [RFC5150]. It enables LSPs of the same LSP stitching is defined in [RFC5150]. It enables LSPs of the same
switching type to be included (stitched) as hops in an end-to-end switching type to be included (stitched) as hops in an end-to-end
skipping to change at page 27, line 10 skipping to change at page 28, line 28
[ISIS-GENAP] Ginsberg, L., Previdi, S., and Shand, M., "Advertising [ISIS-GENAP] Ginsberg, L., Previdi, S., and Shand, M., "Advertising
Generic Information in IS-IS", draft-ietf-isis-genapp, work Generic Information in IS-IS", draft-ietf-isis-genapp, work
in progress. in progress.
[ISIS-IPV6-TE] Harrison, J., Berger, J., and Bartlett, M., "IPv6 [ISIS-IPV6-TE] Harrison, J., Berger, J., and Bartlett, M., "IPv6
Traffic Engineering in IS-IS", draft-ietf-isis-ipv6-te, Traffic Engineering in IS-IS", draft-ietf-isis-ipv6-te,
work in progress. work in progress.
[OSPF-TI] Lindem, A., Roy, A., and Mirtorabi, S., "OSPF Transport [OSPF-TI] Lindem, A., Roy, A., and Mirtorabi, S., "OSPF Transport
Instance Extensions", draft-acee-ospf-transport-instance, Instance Extensions", draft-ietf-ospf-transport-instance,
work in progress. work in progress.
[OSPFv2-MI] Lindem, A., Roy, A., and Mirtorabi, S., "OSPF Multi- [OSPFv2-MI] Lindem, A., Roy, A., and Mirtorabi, S., "OSPF Multi-
Instance Extensions", draft-acee-ospf-multi-instance, work Instance Extensions", draft-ietf-ospf-multi-instance, work
in progress. in progress.
[PCE-LAYER] Oki, E. (Ed.), "PCC-PCE Communication and PCE Discovery [PCE-LAYER] Oki, E. (Ed.), "PCC-PCE Communication and PCE Discovery
Requirements for Inter-Layer Traffic Engineering", Requirements for Inter-Layer Traffic Engineering",
draft-ietf-pce-inter-layer-req, work in progress. draft-ietf-pce-inter-layer-req, work in progress.
8. Editors' Addresses 8. Editors' Addresses
Kohei Shiomoto Kohei Shiomoto
NTT Network Service Systems Laboratories NTT Network Service Systems Laboratories
skipping to change at page 29, line ? skipping to change at page 29, line 19
1600 Amphitheatre Pkwy 1600 Amphitheatre Pkwy
Mountain View, CA 94043 Mountain View, CA 94043
Email: rabbat@alum.mit.edu Email: rabbat@alum.mit.edu
Arthi Ayyangar Arthi Ayyangar
Juniper Networks Juniper Networks
1194 N. Mathilda Ave. 1194 N. Mathilda Ave.
Sunnyvale, CA 94089 Sunnyvale, CA 94089
United States of America United States of America
Email: arthi@juniper.net Email: arthi@juniper.net
Zafar Ali Zafar Ali
Cisco Systems, Inc. Cisco Systems, Inc.
2000 Innovation Drive 2000 Innovation Drive
Kanata, Ontario, K2K 3E8 Kanata, Ontario, K2K 3E8
Canada. Canada.
EMail: zali@cisco.com EMail: zali@cisco.com
Full Copyright Statement
Copyright (c) 2009 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 in effect on the date of
publication of this document (http://trustee.ietf.org/license-info).
Please review these documents carefully, as they describe your rights
and restrictions with respect to this document.
 End of changes. 18 change blocks. 
61 lines changed or deleted 78 lines changed or added

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