Hi PCE'rs,
Please find a new version of our H-PCE architecture draft. In summary the
new version has the following updates:
- A few changes mainly for typos and readability.
- A short section discussing the applicability of BGP-TE.
- Completely updated Security Considerations.
We have no plans to present this work in Paris, but we would be happy to
have discussions, especially with the H-PCE solution authors. We now
consider this to be the "final" version of the document and unless we see
discussion on or off the list that requires updates, we will ask the chairs
to take the I-D to WG last call shortly after Paris.
See you in Paris!
Br, Dan.
-----Original Message-----
From: [email protected] [mailto:[email protected]]
On Behalf Of [email protected]
Sent: 11 March 2012 19:42
To: [email protected]
Cc: [email protected]
Subject: I-D Action: draft-ietf-pce-hierarchy-fwk-01.txt
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-01.txt
Pages : 31
Date : 2012-03-11
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.
A URL for this Internet-Draft is:
http://www.ietf.org/internet-drafts/draft-ietf-pce-hierarchy-fwk-01.txt
Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/
This Internet-Draft can be retrieved at:
ftp://ftp.ietf.org/internet-drafts/draft-ietf-pce-hierarchy-fwk-01.txt
_______________________________________________
I-D-Announce mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/i-d-announce
Internet-Draft directories: http://www.ietf.org/shadow.html or
ftp://ftp.ietf.org/ietf/1shadow-sites.txt
_______________________________________________
Pce mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/pce
