Path computation element - Revision history

Kvng: caps, hyphen

2023-06-11T17:49:24Z

caps, hyphen

← Previous revision		Revision as of 17:49, 11 June 2023
Line 2:		Line 2:

	==Description==		==Description==
	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.		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.		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>		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>		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>

Kvng: match title

2023-03-31T14:37:56Z

match title

← Previous revision		Revision as of 14:37, 31 March 2023
Line 1:		Line 1:
	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.<ref name=pce-rfc>RFC 4655, [http://www.ietf.org/rfc/rfc4655.txt "A Path Computation Element (PCE)-Based Architecture"]</ref>		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.<ref name=pce-rfc>RFC 4655, [http://www.ietf.org/rfc/rfc4655.txt "A Path Computation Element (PCE)-Based Architecture"]</ref>

	==Description==		==Description==

Citation bot: Alter: template type. Add: s2cid, isbn, hdl, doi, pages, year. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2729/3850

2023-03-04T06:08:26Z

Alter: template type. Add: s2cid, isbn, hdl, doi, pages, year. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2729/3850

← Previous revision		Revision as of 06:08, 4 March 2023
Line 25:		Line 25:
	\|title = Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.		\|title = Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.
	\|author = 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.		\|author = 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.
	}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref><ref>{{cite ~~web~~		}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref><ref>{{cite book
	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf		\|url = http://manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
	\|title = PILEP: a contribution to PCE-based interdomain path computation.		\|title = PILEP: a contribution to PCE-based interdomain path computation.
	\|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.		\|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		\|url-status = dead
	\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf		\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf

Kvng: not a proper noun

2021-03-30T13:30:01Z

not a proper noun

← Previous revision		Revision as of 13:30, 30 March 2021
Line 2:		Line 2:

	==Description==		==Description==
	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.		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.		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.

Monkbot: Task 16: replaced (2×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=;

2019-09-27T06:08:49Z

Task 16: replaced (2×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=;

← Previous revision		Revision as of 06:08, 27 September 2019
Line 29:		Line 29:
	\|title = PILEP: a contribution to PCE-based interdomain path computation.		\|title = PILEP: a contribution to PCE-based interdomain path computation.
	\|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.		\|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~~		\|url-status = dead
	\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf		\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
	\|archivedate = 2013-04-10		\|archivedate = 2013-04-10
	\|df =
	}}</ref><ref>{{cite web		}}</ref><ref>{{cite web
	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/CITA2009.pdf		\|url = http://manolodominguez.com/content/common/pdf/cv/publications/CITA2009.pdf
Line 43:		Line 42:

	==Specifications==		==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=~~ }}		* {{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:Computer networking]]		[[Category:Computer networking]]

Peerst: Changed the PACE primer link to a archived version since the original link is broken

2019-09-26T16:42:12Z

Changed the PACE primer link to a archived version since the original link is broken

← Previous revision		Revision as of 16:42, 26 September 2019
Line 16:		Line 16:
	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/ "PACE: Next Steps in PAth Computation Element (PCE) Architectures"]</ref> which is funded by the [[European Union]]'s Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 619712.		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/ "PACE: Next Steps in PAth Computation Element (PCE) Architectures"]</ref> 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.<ref name=primer>PCE Primer [http://www.ict-pace.net/files/3313/8929/2782/PCE_Primer.pdf "PACE project PCE Primer"]</ref>		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 "PACE project PCE Primer"]</ref>

	== PCE extensions ==		== PCE extensions ==

Quuux: clean up ref newlines, spacing, zero-width

2019-09-07T02:04:10Z

clean up ref newlines, spacing, zero-width

InternetArchiveBot: Rescuing 3 sources and tagging 2 as dead. #IABot (v1.6.5)

2018-03-14T06:46:55Z

Rescuing 3 sources and tagging 2 as dead. #IABot (v1.6.5)

← Previous revision		Revision as of 06:46, 14 March 2018
Line 6:		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.		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)"]</ref>		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>		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:		Line 22:

	* Interdomain PCE discovering extensions<ref>{{cite web		* Interdomain PCE discovering extensions<ref>{{cite web
	\| url=http://manolodominguez.com/content/common/pdf/cv/publications/JITEL2008.pdf		\|url = http://manolodominguez.com/content/common/pdf/cv/publications/JITEL2008.pdf
	\| title=Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.		\|title = Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.
	\| author=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.		\|author = 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.
			}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref><ref>{{cite web
		⚫	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
		⚫	\|title = PILEP: a contribution to PCE-based interdomain path computation.
			\|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		}}</ref><ref>{{cite web
	\| url=http://manolodominguez.com/content/common/pdf/cv/publications/~~NETWORKS2008~~.pdf		\|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.
⚫	\| title=PILEP: a contribution to PCE-based interdomain path computation.
	\| 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~~.		\|author = 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.
			}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref>
	}}</ref><ref>{{cite web
⚫	\| 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.
	\| author=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.
	}}</ref>

	== References ==		== References ==
Line 39:		Line 43:

	==Specifications==		==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}}		* {{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]]		[[Category:Computer networking]]

FrescoBot: Bot: link syntax

2018-02-01T16:27:55Z

Bot: link syntax

← Previous revision		Revision as of 16:27, 1 February 2018
Line 2:		Line 2:

	==Description==		==Description==
	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\|~~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.		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.		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.

OldBlackAndWhiteDog: Add Segment Routing as a type of path that can be computed

2018-01-05T17:01:34Z

Add Segment Routing as a type of path that can be computed

← Previous revision		Revision as of 17:01, 5 January 2018
Line 2:		Line 2:

	==Description==		==Description==
	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]] 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.		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\|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.		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.

← Previous revision		Revision as of 02:04, 7 September 2019
Line 10:		Line 10:
	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>		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>

	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>		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>

	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)<ref name=PCEP>RFC 5440 [http://www.rfc-editor.org/rfc/rfc5440.txt "Path Computation Element Communications Protocol"]</ref> which runs over the [[Transmission Control Protocol]] (TCP).		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)<ref name=PCEP>RFC 5440 [http://www.rfc-editor.org/rfc/rfc5440.txt "Path Computation Element Communications Protocol"]</ref> which runs over the [[Transmission Control Protocol]] (TCP).
Line 22:		Line 22:

	* Interdomain PCE discovering extensions<ref>{{cite web		* Interdomain PCE discovering extensions<ref>{{cite web
	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/JITEL2008.pdf		\|url = http://manolodominguez.com/content/common/pdf/cv/publications/JITEL2008.pdf
	\|title = Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.		\|title = Descubrimiento de PCE inter-AS: una aportación a la computación de LSP en sistemas multidominio.
	\|author = 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.		\|author = 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.
	}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref><ref>{{cite web		}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref><ref>{{cite web
	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf		\|url = http://manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
	\|title = PILEP: a contribution to PCE-based interdomain path computation.		\|title = PILEP: a contribution to PCE-based interdomain path computation.
	\|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.		\|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		\|deadurl = yes
	\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf		\|archiveurl = https://web.archive.org/web/20130410161732/http://www.manolodominguez.com/content/common/pdf/cv/publications/NETWORKS2008.pdf
	\|archivedate = 2013-04-10		\|archivedate = 2013-04-10
	\|df =		\|df =
	}}</ref><ref>{{cite web		}}</ref><ref>{{cite web
	\|url = http://manolodominguez.com/content/common/pdf/cv/publications/CITA2009.pdf		\|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.		\|title = RI-CUBE: Dotando al PCE de información abstracta de ingeniería de tráfico interdominio.
	\|author = 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.		\|author = 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.
	}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref>		}}{{dead link\|date=March 2018 \|bot=InternetArchiveBot \|fix-attempted=yes }}</ref>