Revision as of 17:01, 5 January 2018 edit OldBlackAndWhiteDog (talk \| contribs) 150 edits m Add Segment Routing as a type of path that can be computed ← Previous edit		Revision as of 16:27, 1 February 2018 edit undo FrescoBot (talk \| contribs) Bots 1,152,845 edits m Bot: link syntax Next edit →
Line 2: ==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. 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 element: Difference between revisions