Dynamic Placement of Pseudowires using a Path Computation Element
draft-martini-pwe3-ms-pw-pce-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Luca Martini | ||
| Last updated | 2006-10-23 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| 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 is available in these formats:
Abstract
When dynamically established Pseudowires (PW) span across multiple service providers networks, or across multiple autonomous systems, there is a need to calculate the best route among a set of switching point PEs (S- PE). A method for calculating said "best route", and choosing the S-PEs is described in this document using the existing Path Computation Element work done in the PCE WG.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)