Path computation element: Difference between revisions

Revision as of 10:18, 27 January 2012

Revision as of 01:09, 4 July 2012

Line 1:

{{contextcopyedit|date=July 20082012}}

Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint-based path computation is a strategic component of traffic engineering in [[MPLS]] and [[GMPLS]] 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.

AIn computer networks, a '''Pathpath Computationcomputation Elementelement''' (PCE)is a system component, application or network node that is definedcapable byof thedetermining Interneta Engineeringfinding Taska Forcesuitable ([[IETF]])route infor ''RFCconveying 4655''data between a source and a destination.<ref name=pce-rfc>RFC 4655, [http://www.ietf.org/http://www.ietf.org/rfc/rfc4655.txt "A Path Computation Element (PCE)-Based Architecture"]</ref>, as

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 usually available at a network element, yet may still need to be more dynamic than can be provided by a management system.

Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint-based path computation is a strategic component of traffic engineering in [[MPLS]] and [[GMPLS]] 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.

A '''Path Computation Element''' (PCE) is defined by the Internet Engineering Task Force ([[IETF]]) in ''RFC 4655'' <ref name=pce-rfc>RFC 4655, [http://www.ietf.org/http://www.ietf.org/rfc/rfc4655.txt "A Path Computation Element (PCE)-Based Architecture"]</ref>, as

<blockquote>

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 usually available at a network element, yet may still need to be more dynamic than can be provided by a management system.

An entity (component, application, or network node) that is capable of computing a network path or route based on a network graph and applying computational constraints

</blockquote>

Thus, a PCE is an entity capable of computing complex paths for a single or set of services. A PCE might be a [[Computer network|network]] node, network management station, or dedicated computational platform which is aware of the network resources and has the ability to consider multiple constraints for sophisticated path computation. PCE applications include computing 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''<ref name=pce>IETF's Working Group, [http://www.ietf.org/html.charters/pce-charter.html "Path Computation Element (pce)"]</ref>.