%% You should probably cite rfc8751 instead of this I-D.
@techreport{ietf-pce-stateful-hpce-08,
    number =    {draft-ietf-pce-stateful-hpce-08},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-ietf-pce-stateful-hpce/08/},
    author =    {Dhruv Dhody and Young Lee and Daniele Ceccarelli and Jongyoon Shin and Daniel King and Oscar Gonzalez de Dios},
    title =     {{Hierarchical Stateful Path Computation Element (PCE).}},
    pagetotal = 22,
    year =      ,
    month =     ,
    day =       ,
    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). Initialize the result of path computation from PCE is also helpful for the PCC to gracefully establish the computed LSP. 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, and not Stateless, PCEs using the Hierarchical PCE architecture.},
}