Applicability of a Stateful Path Computation Element (PCE)
draft-ietf-pce-stateful-pce-app-05

The information below is for an old version of the document
Document Type Expired Internet-Draft (pce WG)
Last updated 2016-06-28 (latest revision 2015-10-19)
Replaces draft-zhang-pce-stateful-pce-app
Stream IETF
Intended RFC status Informational
Formats
Expired & archived
pdf htmlized bibtex
Reviews
Stream WG state WG Document
Document shepherd Jonathan Hardwick
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to "Jonathan Hardwick" <jonathan.hardwick@metaswitch.com>

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-ietf-pce-stateful-pce-app-05.txt

Abstract

A stateful Path Computation Element (PCE) maintains information about Label Switched Path (LSP) characteristics and resource usage within a network in order to provide traffic engineering calculations for its associated Path Computation Clients (PCCs). This document describes general considerations for a stateful PCE deployment and examines its applicability and benefits, as well as its challenges and limitations through a number of use cases. PCE Communication Protocol (PCEP) extensions required for stateful PCE usage are covered in separate documents.

Authors

Xian Zhang (zhang.xian@huawei.com)
Ina Minei (inaminei@google.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)