A Forward-Search P2MP TE LSP Inter-Domain Path Computation
draft-chen-pce-forward-search-p2mp-path-10
The information below is for an old version of the document.
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Huaimo Chen , Dhruv Dhody | ||
| Last updated | 2016-09-19 (Latest revision 2016-03-18) | ||
| 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-p2mp-path-10.txt
https://www.ietf.org/archive/id/draft-chen-pce-forward-search-p2mp-path-10.txt
Abstract
This document presents a forward search procedure for computing a path for a Point-to-MultiPoint (P2MP) Traffic Engineering (TE) Label Switched Path (LSP) crossing a number of domains through 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.)