Content deleted Content added
m Add pointer to advanced PCE tutorial |
m Ooops. Fix previous |
||
Line 8:
Thus, a PCE is an entity capable of computing paths for a single or set of services. A PCE might be a [[Computer network|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''.<ref name=pce>IETF's Working Group, [http://www.ietf.org/html.charters/pce-charter.html "Path Computation Element (pce)"]</ref>
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<ref name=tutorial>Basic PCE tutorial [http://www.olddog.co.uk/Farrel_PCE_Tutorial.ppt "PCE Tutorial"]</ref> and a tutorial on advanced PCE as presented at ISOCORE's SDN/MPLS 2014 conference.<ref name=
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)<ref name=H-PCE>RFC 6805 [http://www.rfc-editor.org/rfc/rfc6805.txt "Hierarchical PCE"]</ref> and both Stateful and Active PCE.<ref name=Stateful>RFC 7399[http://www.rfc-editor.org/rfc/rfc7399.txt "Unanswered Questions in the Path Computation Element Architecture"]</ref>
| |||