Revision as of 06:08, 27 September 2019 edit Monkbot (talk \| contribs) Bots 3,695,952 edits m Task 16: replaced (2×) / removed (0×) deprecated \|dead-url= and \|deadurl= with \|url-status=; Tag: AWB ← Previous edit		Revision as of 13:30, 30 March 2021 edit undo Kvng (talk \| contribs) Extended confirmed users, New page reviewers 115,948 edits not a proper noun Next edit →
Line 2: ==Description== Routing can be subject to a set of constraints, such as [[~~Quality~~quality of ~~Service~~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 element: Difference between revisions