Optimizations of Label Switched Path State Synchronization Procedures for a Stateful PCE

The information below is for an old version of the document
Document Type Expired Internet-Draft (pce WG)
Authors Edward Crabbe  , Ina Minei  , Jan Medved  , Robert Varga  , Xian Zhang  , Dhruv Dhody 
Last updated 2014-12-28 (latest revision 2014-06-26)
Replaces draft-minei-pce-stateful-sync-optimizations
Stream Internet Engineering Task Force (IETF)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


A stateful Path Computation Element (PCE) has access to not only the information disseminated by the network's Interior Gateway Protocol (IGP), but also the set of active paths and their reserved resources for its computation. The additional Label Switched Path (LSP) state information allows the PCE to compute constrained paths while considering individual LSPs and their interactions. This requires a reliable state synchronization mechanism between the PCE and the network, PCE and path computation clients (PCCs), and between cooperating PCEs. The basic mechanism for state synchronization is part of the stateful PCE specification. This draft presents motivations for optimizations to the base state synchronization procedure and specifies the required Path Computation Element Communication Protocol (PCEP) extensions.


Edward Crabbe (edc@google.com)
Ina Minei (inaminei@google.com)
Jan Medved (jmedved@cisco.com)
Robert Varga (robert.varga@pantheon.sk)
Xian Zhang (zhang.xian@huawei.com)
Dhruv Dhody (dhruv.ietf@gmail.com)

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