Path computation element: Difference between revisions

Revision as of 10:49, 24 December 2009

Revision as of 11:16, 24 December 2009

Line 1:

{{context|date=July 2008}}

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, for 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.

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.