I-D Action: draft-ietf-pce-hierarchy-fwk-05.txt

internet-drafts@ietf.org Wed, 29 August 2012 05:31 UTC

MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: quoted-printable
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Subject: I-D Action: draft-ietf-pce-hierarchy-fwk-05.txt
Message-ID: <20120829053123.7372.57456.idtracker@ietfa.amsl.com>
Date: Tue, 28 Aug 2012 22:31:23 -0700
Cc: pce@ietf.org
Precedence: list
Reply-To: internet-drafts@ietf.org

A New Internet-Draft is available from the on-line Internet-Drafts directories.
 This draft is a work item of the Path Computation Element Working Group of the IETF.

	Title           : The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS
	Author(s)       : Daniel King
                          Adrian Farrel
	Filename        : draft-ietf-pce-hierarchy-fwk-05.txt
	Pages           : 31
	Date            : 2012-08-28

Abstract:
   Computing optimum routes for Label Switched Paths (LSPs) across
   multiple domains in MPLS Traffic Engineering (MPLS-TE) and GMPLS
   networks presents a problem because no single point of path
   computation is aware of all of the links and resources in each
   domain. A solution may be achieved using the Path Computation
   Element (PCE) architecture.

   Where the sequence of domains is known a priori, various techniques
   can be employed to derive an optimum path. If the domains are
   simply-connected, or if the preferred points of interconnection are
   also known, the Per-Domain Path Computation technique can be used.
   Where there are multiple connections between domains and there is
   no preference for the choice of points of interconnection, the
   Backward Recursive Path Computation Procedure (BRPC) can be used to
   derive an optimal path.

   This document examines techniques to establish the optimum path when
   the sequence of domains is not known in advance. The document
   shows how the PCE architecture can be extended to allow the optimum
   sequence of domains to be selected, and the optimum end-to-end path
   to be derived through the use of a hierarchical relationship between
   domains.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-pce-hierarchy-fwk

There's also a htmlized version available at:
http://tools.ietf.org/html/draft-ietf-pce-hierarchy-fwk-05

A diff from the previous version is available at:
http://www.ietf.org/rfcdiff?url2=draft-ietf-pce-hierarchy-fwk-05


Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/

I-D Action: draft-ietf-pce-hierarchy-fwk-05.txt internet-drafts