Hierarchical Stateful Path Computation Element (PCE).
draft-dhodylee-pce-stateful-hpce-03
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2017-03-13 | ||
| Replaced by | RFC 8751 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-pce-stateful-hpce | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-dhodylee-pce-stateful-hpce-03.txt
Abstract
A Stateful Path Computation Element (PCE) maintains information on the current network state, including: computed Label Switched Path (LSPs), reserved resources within the network, and pending path computation requests. This information may then be considered when computing new traffic engineered LSPs, and for associated and dependent LSPs, received from Path Computation Clients (PCCs). The Hierarchical Path Computation Element (H-PCE) architecture, provides an architecture to allow the optimum sequence of inter-connected domains to be selected, and network policy to be applied if applicable, via the use of a hierarchical relationship between PCEs. Combining the capabilities of Stateful PCE and the Hierarchical PCE would be advantageous. This document describes general considerations and use cases for the deployment of Stateful PCE(s) using the Hierarchical PCE architecture.
Authors
Dhruv Dhody
(dhruv.ietf@gmail.com)
Young Lee
(leeyoung@huawei.com)
Daniele Ceccarelli
(daniele.ceccarelli@ericsson.com)
Jongyoon Shin
(jongyoon.shin@sk.com)
Daniel King
(d.king@lancaster.ac.uk)
Oscar de Dios
(ogondio@tid.es)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)