Extensions to the Path Computation Element Protocol (PCEP) for residual path bandwidth support
draft-lazzeri-pce-residual-bw-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Francesco Lazzeri , Daniele Ceccarelli , Young Lee | ||
| Last updated | 2017-11-13 (Latest revision 2017-05-12) | ||
| RFC stream | (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
The ability of a hierarchy of PCEs to compute accurate end-to-end paths across multiple domains is recognized as an important requirement in many applications. This document describes extensions to the PCE Communication Protocol (PCEP) in order to provide new path-related bandwidth metrics, which a PCC, like a H-PCE (either stateful or stateless), can use from an erstwhile path computation to deploy multiple LSPs (having the same end-points and constraints) without additional requests, until either the remaining bandwidth along that path is all allocated or a deployment fails. This information would also be beneficial for implementing abstractions of the domain topology, building the abstract connectivity incrementally, based only on really used constraints, as soon as path computation results are returned.
Authors
Francesco Lazzeri
Daniele Ceccarelli
Young Lee
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)