Subject: Re: [Pce] New Version Notification for draft-king-pce-hierarchy-fwk-04

From: "Daniel King" <[email-masked]>
Date: Mon, 5 Jul 2010 15:52:10 +0100

Hi All, 

The authors of H-PCE recently submitted a new version of the draft. 

http://tools.ietf.org/html/draft-king-pce-hierarchy-fwk-04

Updates include:

- We have reviewed and documented the applicability of H-PCE to traversing multiple Antonymous Systems and Areas. 
- We have begun to document some of the required PCEP extensions for H-PCE. This work will probably be broken out into a separate document in the future.
- Indentified an additional PCEP MIB to report parent PCE and child PCE information.
- Fixed various nits. 

Br, Dan.

-----Original Message-----
From: IETF I-D Submission Tool [mailto:[email-masked]] 
Sent: 02 July 2010 23:25
To: [email-masked]
Cc: [email-masked]; [email-masked]; [email-masked]
Subject: New Version Notification for draft-king-pce-hierarchy-fwk-04

A new version of I-D, draft-king-pce-hierarchy-fwk-04.txt has been successfully submitted by Daniel King and posted to the IETF repository.

Filename:	 draft-king-pce-hierarchy-fwk
Revision:	 04
Title:		 The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS
Creation_date:	 2010-07-02
WG ID:		 Independent Submission
Number_of_pages: 25

Abstract:
Computing optimum routes for Label Switched Paths (LSPs) across
multiple domains in Multiprotocol Label Switching Traffic Engineering
(MPLS-TE) and Generalized MPLS (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.

The IETF Secretariat.