datatracker.ietf.org
Sign In
Version 4.51.p2, 2013-06-11
Report a bug

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-05

RFC
Document Stream: IETF
Last updated: 2012-08-28
Replaces: draft-king-pce-hierarchy-fwk
Intended RFC status: Informational
Other versions: (expired, archived): plain text, pdf, html
IETF State: WG Document (pce)
Document shepherd:(None)
Shepherd writeup
Consensus:Unknown
IESG State: RFC 6805
IANA Action State: No IC 
On agenda of 2012-09-13 IESG telechat
Responsible AD: Stewart Bryant
IESG Note: Julien Meuric (julien.meuric@orange.com) is the document shepherd.
Send notices to: pce-chairs@tools.ietf.org, draft-ietf-pce-hierarchy-fwk@tools.ietf.org

This Internet-Draft is no longer active. Unofficial copies of old Internet-Drafts can be found here:
http://tools.ietf.org/id/draft-ietf-pce-hierarchy-fwk.

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.

Authors:
Daniel King <daniel@olddog.co.uk>
Adrian Farrel <adrian@olddog.co.uk>

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid)