Procedures for Dynamically Signaled Hierarchical Label Switched Paths
RFC 6107
Internet Engineering Task Force (IETF) K. Shiomoto, Ed.
Request for Comments: 6107 NTT
Updates: 3477, 4206 A. Farrel, Ed.
Category: Standards Track Old Dog Consulting
ISSN: 2070-1721 February 2011
Procedures for Dynamically Signaled Hierarchical Label Switched Paths
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 traffic engineering (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 deprecate the technique for
the signaling of LSPs that are to be used as numbered TE links
described in RFC 4206.
Status of This Memo
This is an Internet Standards Track document.
This document is a product of the Internet Engineering Task Force
(IETF). It represents the consensus of the IETF community. It has
received public review and has been approved for publication by the
Internet Engineering Steering Group (IESG). Further information on
Internet Standards is available in Section 2 of RFC 5741.
Information about the current status of this document, any errata,
and how to provide feedback on it may be obtained at
http://www.rfc-editor.org/info/rfc6107.
Shiomoto & Farrel Standards Track [Page 1]
RFC 6107 Procedures for H-LSPs February 2011
Copyright Notice
Copyright (c) 2011 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 and Problem Statement ..............................3
1.1. Background .................................................4
1.1.1. Hierarchical LSPs ...................................4
1.1.2. LSP Stitching Segments ..............................5
1.1.3. Private Links .......................................5
1.1.4. Routing Adjacencies .................................5
1.1.5. Forwarding Adjacencies ..............................5
1.1.6. Client/Server Networks ..............................6
1.1.7. Link Bundles ........................................6
1.2. Desired Function ...........................................7
1.3. Existing Mechanisms ........................................7
1.3.1. LSP Setup ...........................................7
1.3.2. Routing Adjacency Establishment and Link
State Advertisement .................................7
1.3.3. TE Link Advertisement ...............................7
1.3.4. Configuration and Management Techniques .............8
1.3.5. Signaled Unnumbered FAs .............................8
1.3.6. Establishing Numbered FAs through Signaling
and Routing .........................................9
1.4. Overview of Required Extensions ...........................10
1.4.1. Efficient Signaling of Numbered FAs ................10
1.4.2. LSPs for Use as Private Links ......................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 ..........11
1.4.5. Support for IPv4 and IPv6 ..........................11
1.4.6. Backward Compatibility .............................11
2. Overview of Solution ...........................................11
2.1. Common Approach for Numbered and Unnumbered Links .........11
2.2. LSP Usage Indication ......................................12
2.3. IGP Instance Identification ...............................12
2.4. Link Bundle Identification ................................12
Shiomoto & Farrel Standards Track [Page 2]
Show full document text