Last Call: <draft-ietf-pce-hierarchy-fwk-04.txt> (The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS) to Informational RFC

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



The IESG has received a request from the Path Computation Element WG
(pce) to consider the following document:
- 'The Application of the Path Computation Element Architecture to the
   Determination of a Sequence of Domains in MPLS and GMPLS'
  <draft-ietf-pce-hierarchy-fwk-04.txt> as Informational RFC

The IESG plans to make a decision in the next few weeks, and solicits
final comments on this action. Please send substantive comments to the
ietf@ietf.org mailing lists by 2012-08-24. Exceptionally, comments may be
sent to iesg@ietf.org instead. In either case, please retain the
beginning of the Subject line to allow automated sorting.

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 file can be obtained via
http://datatracker.ietf.org/doc/draft-ietf-pce-hierarchy-fwk/

IESG discussion can be tracked via
http://datatracker.ietf.org/doc/draft-ietf-pce-hierarchy-fwk/ballot/


No IPR declarations have been submitted directly on this I-D.




[Index of Archives]     [IETF]     [IETF Discussion]     [Linux Kernel]

  Powered by Linux