Browse Prior Art Database

LDP Extension for Inter-Area Label Switched Paths (LSPs) (RFC5283)

IP.com Disclosure Number: IPCOM000172969D
Original Publication Date: 2008-Jul-01
Included in the Prior Art Database: 2008-Jul-23
Document File: 13 page(s) / 27K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

B. Decraene: AUTHOR [+3]

Abstract

To facilitate the establishment of Label Switched Paths (LSPs) that would span multiple IGP areas in a given Autonomous System (AS), this document describes a new optional Longest-Match Label Mapping Procedure for the Label Distribution Protocol (LDP).

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 10% of the total text.

Network Working Group                                        B. Decraene Request for Comments: 5283                                   JL. Le Roux Category: Standards Track                                 France Telecom                                                                 I. Minei                                                   Juniper Networks, Inc.                                                                July 2008

         LDP Extension for Inter-Area Label Switched Paths (LSPs)

Status of This Memo

   This document specifies an Internet standards track protocol for the    Internet community, and requests discussion and suggestions for    improvements.  Please refer to the current edition of the "Internet    Official Protocol Standards" (STD 1) for the standardization state    and status of this protocol.  Distribution of this memo is unlimited.

Abstract

   To facilitate the establishment of Label Switched Paths (LSPs) that    would span multiple IGP areas in a given Autonomous System (AS), this    document describes a new optional Longest-Match Label Mapping    Procedure for the Label Distribution Protocol (LDP).

   This procedure allows the use of a label if the Forwarding    Equivalence Class (FEC) Element matches an entry in the Routing    Information Base (RIB).  Matching is defined by an IP longest-match    search and does not mandate an exact match.

Table of Contents

   1. Introduction ....................................................2

   2. Conventions Used in This Document ...............................2

   3. Terminology .....................................................2

   4. Problem Statement ...............................................3

   5. Longest-Match Label Mapping Message Procedure ...................4

   6. Application Examples ............................................6

      6.1. Inter-Area LSPs ............................................6

      6.2. Use of Static Routes .......................................7

   7. Caveats for Deployment ..........................................8

      7.1. Deployment Considerations ..................................8

      7.2. Routing Convergence Time Considerations ....................8

   8. Security Considerations .........................................9

   9. References ......................................................9

      9.1. Normative References .......................................9

      9.2. Informative References .....................................9

   10. Acknowledgments .....................................