{
  "number": 4655,
  "title": "A Path Computation Element (PCE)-Based Architecture",
  "authors": [
    "A. Farrel",
    "J.-P. Vasseur",
    "J. Ash"
  ],
  "published": "2006-08",
  "status": "Informational",
  "stream": "IETF",
  "area": "rtg",
  "working_group": "pce",
  "pages": 40,
  "formats": [
    "TXT",
    "HTML"
  ],
  "abstract": "Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains.\n\nThis document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed. This memo provides information for the Internet community.",
  "keywords": [
    "traffic engineering"
  ],
  "draft": "draft-ietf-pce-architecture-05",
  "doi": "10.17487/RFC4655",
  "urls": {
    "html": "https://rfc.dk/rfc4655/",
    "text": "https://rfc.dk/rfc4655.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc4655",
    "datatracker": "https://datatracker.ietf.org/doc/rfc4655/"
  },
  "text_modified": "2006-08-18T21:53:37Z"
}