@techreport{fuxh-pce-drpc-03,
    number =    {draft-fuxh-pce-drpc-03},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-fuxh-pce-drpc/03/},
    author =    {Xihua Fu and Yuanlin Bao and Yongli Zhao and Jie Zhang},
    title =     {{A Dual-end Recursive PCE-Based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths}},
    pagetotal = 21,
    year =      2011,
    month =     aug,
    day =       30,
    abstract =  {A dual-end recursive PCE-based computation procedure (DRPC) is proposed to compute shortest constrained inter-domain traffic engineering label switched paths based on BRPC in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. By recursively performing shortest path algorithm and transferring the segmental path computation result from both ends bi-directionally, they meet at one of the Middle PCEs, generating a directional shortest path graph into which the two shortest path trees are stitched together. Therefore, the end-to-end constrained inter- domain traffic engineering label switched path, even k shortest paths can be gained from the directional shortest path graph directly.},
}