A Forward-Search P2P TE LSP Inter-Domain Path Computation.
draft-chen-pce-forward-search-p2p-path-computation-05
The information below is for an old version of the document.
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Huaimo Chen , Dhruv Dhody | ||
| Last updated | 2013-03-19 (Latest revision 2012-09-15) | ||
| Stream | (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) |
This Internet-Draft is no longer active. A copy of
the expired Internet-Draft can be found at:
https://www.ietf.org/archive/id/draft-chen-pce-forward-search-p2p-path-computation-05.txt
https://www.ietf.org/archive/id/draft-chen-pce-forward-search-p2p-path-computation-05.txt
Abstract
This document presents a forward search procedure for computing paths for Point-to-Point (P2P) Traffic Engineering (TE) Label Switched Paths (LSPs) crossing a number of domains using multiple Path Computation Elements (PCEs). In addition, extensions to the Path Computation Element Communication Protocol (PCEP) for supporting the forward search procedure are described.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)