Path Computation Element (PCE) Architecture
draft-ash-pce-architecture-01
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Author | Adrian Farrel | ||
| Last updated | 2008-04-16 (Latest revision 2005-02-17) | ||
| Replaced by | RFC 4655 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-pce-architecture | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-ash-pce-architecture-01.txt
Abstract
Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region or multi-layers networks is highly complex and may require special computational components and cooperation between the different network domains. This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)