1 / 18

Constraint-Based Routing in MPLS

Constraint-Based Routing in MPLS. Constraint Based Routing (CBR). What is CBR Each link a collection of attributes (performance, administrative) Path built to satisfy/not to violate some constraints, at the same time optimizing some scalar metrics Applications Traffic Engineering

rowdy
Download Presentation

Constraint-Based Routing in MPLS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Constraint-Based Routing in MPLS CSE 8344

  2. Constraint Based Routing (CBR) • What is CBR • Each link a collection of attributes (performance, administrative) • Path built to satisfy/not to violate some constraints, at the same time optimizing some scalar metrics • Applications • Traffic Engineering • Fast Re-route • QoS support • How different from IP routing • CBR is source based whereas IP routing is distributed • CBR needs explicit routing • Support for distribution of link attributes CSE 8344

  3. Traffic Engineering Objectives • Traffic Engineering (TE) concerned with performance optimization • The key performance objectives • traffic oriented e.g. minimization of packet loss • resource oriented - optimization of resource utilization e.g. efficient management of bandwidth CSE 8344

  4. Objectives (cont’d) • Minimizing congestion is a major traffic and resource oriented performance objective • Congestion manifest under two scenarios • Network resources insufficient or inadequate • Solved by capacity expansion or classical congestion control techniques • Inefficient mapping of traffic streams onto available resources • Reduced by adopting load balancing policies CSE 8344

  5. MPLS and Traffic Engineering • Main components used • Traffic Trunk - aggregation of traffic flows of the same class which are placed inside a Label Switched Path • Induced MPLS Graph • Analogous to a virtual topology • Logically mapped onto the physical network • Set of LSRs as nodes of the graph • Set of LSPs providing logical point to point connectivity between LSRs as edges CSE 8344

  6. CBR Components • Mechanism for source based path computing • Mechanism to collect necessary information • Constraints (local), attributes, topology • Support forwarding along the computed paths • Notification of residual resources after allocation CSE 8344

  7. Constrain-Based SPF 7 2 150 45 4 1 150 150 150 150 5 3 6 150 CSE 8344

  8. CSPF • Uses the following inputs • Link attributes • Topology state information • Path constraints • Basic approach • Prune resources that do not meet the constraints • Run a shortest path algorithm on the residual graph CSE 8344

  9. MPLS for Forwarding • Ideal to use MPLS explicit routing capability • Once the path is computed • Need to establish forwarding state along the path • Reserve resources along the path • Two approaches • RSVP extensions • CR-LDP CSE 8344

  10. CBR - Forwarding • RSVP extensions • How to send PATH messages on explicit routes? • Introduce new object ERO (Explicit route object) similar to source routing • Use RESV message for label binding • CR-LDP • In addition to using label_request and label_mapping messages, use ER message similar to ERO CSE 8344

  11. CBR (cont’d) • Comparison of RSVP and CR-LDP • Scalability • Signaling mechanism • Qos Models CSE 8344

  12. Fish Network R8 R3 150 R4 150 R5 R2 150 R1 R6 R7 150 150 CSE 8344

  13. Is Plain IP Enough? R8 R3 150 R4 150 R5 R2 150 R1 R6 R7 150 Under utilized 150 CSE 8344

  14. Why IP Routing Fails • Based only on metric optimization • Shortest path • Administrative optimization • Split paths • Per link constraints not taken into consideration CSE 8344

  15. TE in MPLS Using CBR • Define traffic trunks • Collection of micro-flows that share same path and class of service • These are not end-to-end paths, rather paths within a single service provider • No. of trunks dependent only on the topology • Forwarding table does not grow with the traffic • Rerouting • RSVP, CR-LDP, or IGP CSE 8344

  16. Fast Rerouting • Total restoration time after failure • Failure detection time • Propagation • Computation of new path • Usually the 2nd and 3rd steps are significantly slow CSE 8344

  17. Is FR possible with IP? R1 R2 X R3 R5 R4 Even if the traffic is rerouted to R3, it will send that back to R1 since R3 is not aware of the failure CSE 8344

  18. FR using CBR • Compute protection LSP for every link • When a failure happens • Traffic rerouted to the protection LSP • Use label stacking for the transit within the protection LSP • Beyond the end-nodes labels original labels remain in tact CSE 8344

More Related