Browse Prior Art Database

A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths (RFC5441) Disclosure Number: IPCOM000181603D
Original Publication Date: 2009-Apr-01
Included in the Prior Art Database: 2009-Apr-07
Document File: 19 page(s) / 40K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

JP. Vasseur: AUTHOR [+5]


The ability to compute shortest constrained Traffic Engineering Label Switched Paths (TE LSPs) in Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks across multiple domains has been identified as a key requirement. In this context, a domain is a collection of network elements within a common sphere of address management or path computational responsibility such as an IGP area or an Autonomous Systems. This document specifies a procedure relying on the use of multiple Path Computation Elements (PCEs) to compute such inter-domain shortest constrained paths across a predetermined sequence of domains, using a backward-recursive path computation technique. This technique preserves confidentiality across domains, which is sometimes required when domains are managed by different service providers.

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

Network Working Group                                   JP. Vasseur, Ed. Request for Comments: 5441                            Cisco Systems, Inc Category: Standards Track                                       R. Zhang                                                               BT Infonet                                                                 N. Bitar                                                                  Verizon                                                              JL. Le Roux                                                           France Telecom                                                               April 2009

  A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute          Shortest Constrained Inter-Domain Traffic Engineering                           Label Switched Paths

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.

Copyright Notice

   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 (    Please review these documents carefully, as they describe your rights    and restrictions with respect to this document.

   This document may contain material from IETF Documents or IETF    Contributions published or made publicly available before November    10, 2008.  The person(s) controlling the copyright in some of this    material may not have granted the IETF Trust the right to allow    modifications of such material outside the IETF Standards Process.    Without obtaining an adequate license from the person(s) controlling    the copyright in such materials, this document may not be modified    outside the IETF Standards Process, and derivative works of it may    not be created outside the IETF Standards Process, except to format    it for publication as an RFC or to translate it into languages other    tha...