A Backward Recursive PCE-based Computation (BRPC) procedure to compute shortest inter-domain Traffic Engineering Label Switched Path
draft-vasseur-ccamp-brpc-00
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Author | JP Vasseur | ||
| Last updated | 2006-02-07 | ||
| 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 | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-vasseur-ccamp-brpc-00.txt
Abstract
This document specifies a Path Computation Element (PCE)-based procedure to compute inter-domain Traffic Engineering (TE) Multiprotocol Label Switched (MPLS) and Generalized MPLS (GMPLS) Label Switched (LSP) constrained shortest paths. In this document a domain is referred to as a collection of network elements within a common sphere of address management or path computational responsibility such as IGP areas and Autonomous Systems.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)