Content deleted Content added
m Bot: link syntax |
Rescuing 3 sources and tagging 2 as dead. #IABot (v1.6.5) |
||
Line 6:
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 [[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)"] {{webarchive|url=https://web.archive.org/web/20090710130634/http://www.ietf.org/html.charters/pce-charter.html |date=2009-07-10 }}</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.pdf "PCE Tutorial"]</ref> and a tutorial on advanced PCE as presented at ISOCORE's SDN/MPLS 2014 conference.<ref name=AdvTutorial>Advanced PCE tutorial [http://www.olddog.co.uk/AdvancedPCE.pdf "Advanced PCE Tutorial"]</ref>
Line 22:
* Interdomain PCE discovering extensions<ref>{{cite web
|
|
|
}}{{dead link|date=March 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref><ref>{{cite web
|author = 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.
|deadurl = yes
|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
|archivedate = 2013-04-10
|df =
}}</ref><ref>{{cite web
|
▲| title=PILEP: a contribution to PCE-based interdomain path computation.
|
}}{{dead link|date=March 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref>
▲| url=http://manolodominguez.com/content/common/pdf/cv/publications/CITA2009.pdf
▲| title=RI-CUBE: Dotando al PCE de información abstracta de ingeniería de tráfico interdominio.
== References ==
Line 39 ⟶ 43:
==Specifications==
* {{cite web |url=http://www.ietf.org/html.charters/pce-charter.html |title=Path Computation Element (pce) – Charter |publisher=Ietf.org |date=2012-07-03 |accessdate=2012-07-08 |deadurl=yes |archiveurl=https://web.archive.org/web/20090710130634/http://www.ietf.org/html.charters/pce-charter.html |archivedate=2009-07-10 |df= }}
[[Category:Computer networking]]
| |||