Jump to content

Path computation element

Edit links
From Wikipedia, the free encyclopedia
(Redirected from Path Computation Element)

In computer networks, a path computation element (PCE) is a system component, application, or network node that is capable of determining and finding a suitable route for conveying data between a source and a destination.[1]

Description

[edit]

Routing can be subject to a set of constraints, such as quality of service (QoS), policy, or price. Constraint-based path computation is a strategic component of traffic engineering in MPLS, GMPLS and Segment Routing networks. It is used to determine the path through the network that traffic should follow, and provides the route for each label-switched path (LSP) that is set up.

Path computation has previously been performed either in a management system or at the head end of each LSP. But path computation in large, multi-domain networks may be very complex and may require more computational power and network information than is typically available at a network element, yet may still need to be more dynamic than can be provided by a management system.

Thus, a PCE is an entity capable of computing paths for a single or set of services. A PCE might be a network node, network management station, or dedicated computational platform that is resource-aware and has the ability to consider multiple constraints for sophisticated path computation. PCE applications compute label-switched paths for MPLS and GMPLS traffic engineering. The various components of the PCE architecture are in the process of being standardized by the IETF's PCE Working Group.[2]

PCE represents a vision of networks that separates route computations from the signaling of end-to-end connections and from actual packet forwarding. There is a basic tutorial on PCE as presented at ISOCORE's MPLS2008 conference[3] and a tutorial on advanced PCE as presented at ISOCORE's SDN/MPLS 2014 conference.[4]

Since the early days, the PCE architecture has evolved considerably to encompass more sophisticated concepts and allow application to more complicated network scenarios. This evolution includes Hierarchical PCE (H-PCE)[5] and both Stateful and Active PCE.[6]

A potential deployment of PCE separates the computation element from the client (the PCC) that request computation services. Communications between the PCE and PCC are achieved using the Path Computation Element Communication Protocol (PCEP)[7] which runs over the Transmission Control Protocol (TCP).

As the architecture has evolved, new protocol extensions have been developed to add functionality to support new applications and the new architectural elements. These developments are tracked by the PACE project[8] which is funded by the European Union's Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 619712.

The PACE project has developed a primer for those interested in PCE. It can be downloaded without charge from the PACE website.[9]

PCE extensions

[edit]

There are several PCE extensions to achieve different goals. For example:

References

[edit]
  1. ^ RFC 4655, "A Path Computation Element (PCE)-Based Architecture"
  2. ^ IETF's Working Group, "Path Computation Element (pce)" Archived 2009-07-10 at the Wayback Machine
  3. ^ Basic PCE tutorial "PCE Tutorial"
  4. ^ Advanced PCE tutorial "Advanced PCE Tutorial"
  5. ^ RFC 6805 "Hierarchical PCE"
  6. ^ RFC 7399 "Unanswered Questions in the Path Computation Element Architecture"
  7. ^ RFC 5440 "Path Computation Element Communications Protocol"
  8. ^ PACE "PACE: Next Steps in PAth Computation Element (PCE) Architectures"
  9. ^ PCE Primer "PACE project PCE Primer"
  10. ^ M. Domínguez-Dorado, José-Luis González-Sánchez, J. Domingo-Pascual. Libro de actas de las VII Jornadas de Ingeniería Telemática (JITEL'08) Págs. 80–86. ISBN 978-84-612-5474-3. Alcalá de Henares (ESPAÑA), Septiembre de 2008. "Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)[permanent dead link]
  11. ^ M. Domínguez-Dorado, José-Luis González-Sánchez, J. Domingo-Pascual. Proceedings of the 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS'08). pp. 1–7. IEEE catalog number CFP08568-USB. ISBN 978-963-8111-68-5. DOI 10.1109/NETWKS.2008.4763712. Budapest (HUNGARY), October, 2008. (2008). PILEP: a contribution to PCE-based interdomain path computation (PDF). pp. 1–17. doi:10.1109/NETWKS.2008.4763712. hdl:2117/12929. ISBN 978-963-8111-68-5. S2CID 18470823. Archived from the original (PDF) on 2013-04-10.{{cite book}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)
  12. ^ M. Domínguez-Dorado, José-Luis González-Sánchez, J. Domingo-Pascual, J. Carmona-Murillo. Proceedings of the V Iberoamerican Conference on Telematics (CITA'09). pp. 14–21. ISBN 978-84-613-2679-2. Gijón (SPAIN), May, 2009. "RI-CUBE: Dotando al PCE de información abstracta de ingeniería de tráfico interdominio" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link) CS1 maint: numeric names: authors list (link)[permanent dead link]

Specifications

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Path_computation_element&oldid=1159653519"