Content deleted Content added
Add some detail about architecture and protocol. Point to the PACE project. |
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 |
||
| (20 intermediate revisions by 11 users not shown) | |||
Line 2:
==Description==
Routing can be subject to a set of constraints, such 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 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
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
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
A potential deployment of PCE separates the computation element from the client (the PCC) that request computation services.
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<ref name=PACE>PACE [http://www.ict-pace.net/
The PACE project has developed a primer for those interested in PCE. It can be downloaded without charge from the PACE website.<ref name=primer>PCE Primer [https://web.archive.org/web/20160304071829/http://www.ict-pace.net/files/3313/8929/2782/PCE_Primer.pdf
== PCE extensions ==
Line 22:
* Interdomain PCE discovering extensions<ref>{{cite web
|
|
|
}}{{dead link|date=March 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref><ref>{{cite book
|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.
|year = 2008
|pages = 1–17
|doi = 10.1109/NETWKS.2008.4763712
|hdl = 2117/12929
|isbn = 978-963-8111-68-5
|s2cid = 18470823
|url-status = dead
|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
|archivedate = 2013-04-10
}}</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 ⟶ 48:
==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 |url-status=dead |archiveurl=https://web.archive.org/web/20090710130634/http://www.ietf.org/html.charters/pce-charter.html |archivedate=2009-07-10 }}
[[Category:
| |||