Relayed CSPF for Multi-Area Multi-AS PCE
draft-lu-relayed-cspf-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Wenhu Lu , Sriganesh Kini , Srikanth Narayanan | ||
| Last updated | 2011-05-02 | ||
| 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
For LSPs that span across multiple areas or multiple autonomous systems (AS), the path computation element (PCE) in each area or each AS can cooperate and conclude the optimal results if so exist. An upstream PCE, though incapable to carry out the path computation for the tailend outside of its domain, can provide the history of the computation to its downstream PCEs which will assume the computation job till it is accomplished or relay the baton to the next runner.
Authors
Wenhu Lu
Sriganesh Kini
Srikanth Narayanan
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)