@misc{rfc7334,
    series =    {Request for Comments},
    number =    7334,
    howpublished =  {RFC 7334},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC7334},
    url =       {https://www.rfc-editor.org/info/rfc7334},
    author =    {Quintin Zhao and Dhruv Dhody and Daniel King and Zafar Ali and Ramon Casellas},
    title =     {{PCE-Based Computation Procedure to Compute Shortest Constrained Point-to-Multipoint (P2MP) Inter-Domain Traffic Engineering Label Switched Paths}},
    pagetotal = 25,
    year =      2014,
    month =     aug,
    abstract =  {The ability to compute paths for constrained point-to-multipoint (P2MP) Traffic Engineering Label Switched Paths (TE LSPs) across multiple domains has been identified as a key requirement for the deployment of P2MP services in MPLS- and GMPLS-controlled networks. The Path Computation Element (PCE) has been recognized as an appropriate technology for the determination of inter-domain paths of P2MP TE LSPs. This document describes an experiment to provide procedures and extensions to the PCE Communication Protocol (PCEP) for the computation of inter-domain paths for P2MP TE LSPs.},
}