{
  "number": 7334,
  "title": "PCE-Based Computation Procedure to Compute Shortest Constrained Point-to-Multipoint (P2MP) Inter-Domain Traffic Engineering Label Switched Paths",
  "authors": [
    "Q. Zhao",
    "D. Dhody",
    "D. King",
    "Z. Ali",
    "R. Casellas"
  ],
  "published": "2014-08",
  "status": "Experimental",
  "stream": "IETF",
  "area": "rtg",
  "working_group": "pce",
  "pages": 25,
  "formats": [
    "TXT",
    "HTML"
  ],
  "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.\n\nThis 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.",
  "keywords": [
    "Core-tree"
  ],
  "draft": "draft-ietf-pce-pcep-inter-domain-p2mp-procedures-08",
  "doi": "10.17487/RFC7334",
  "urls": {
    "html": "https://rfc.dk/rfc7334/",
    "text": "https://rfc.dk/rfc7334.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc7334",
    "datatracker": "https://datatracker.ietf.org/doc/rfc7334/"
  },
  "text_modified": "2014-08-12T19:04:14Z"
}