2. Path Protection in MPLS Networks Using Segment Based Approach

3. Overview Short Intro to MPLS Introduction to Our work – Protection and the segment Based approach Algorithms for QoS constraints –Switch Over time Algorithm Greedy Approach Consideration of Backup Paths –Conserving protection resources – sharing bw –End-to-End delay and Jitter –Combining the above constraints –Reliability Visualization System Experimental Results Conclusion and work done

4. Introduction to MPLS 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 Mapping: 0.40 Request: 47.1 Mapping: 0.50 Request: 47.1

5. Label Switched Path (LSP) 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 IP 47.1.1.1

6. MPLS : ROUTE AT EDGE, SWITCH IN CORE IP Forwarding LABEL SWITCHING IP Forwarding IP #L1IP#L2IP#L3 IP  Applies concept of VC routing  Packet forwarding is done based on Label Switching  FEC: Destination address prefix, Traffic Engineering tunnel, Class of Service.

7. Introduction to Path Protection 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3

8. Introduction to Path Protection 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 BACKUP PATH

9. Requirements of Path Protection Should Reroute the traffic satisfying certain QoS constraints Should aim to conserve the amount of protection resources reserved

10. Global Path Protection Backup Path

11. Local Path Protection

12. Segment Based Path Protection  Look at the path as a group of segments – protect each segment separately  Results in fewer backup paths – conserves resources  Meets QoS constraints in a “tight” manner  Gives flexibility Issue : How to segment the path ?

13. Algorithms for QoS constraints

14. QoS Constraints Important parameters –Switch-Over Time –End-to-End Delay –Jitter –Reliability –Combination of above Have to conserve protection resources

15. Bounded Switch Over Time Definition of Switch Over Time

16. An expression for switch over time Analysis for switch over time RTT( R i, R j ) + T test < 

17. Example for Segment Based Approach

18. Here we are able to meet the Switch Over time constraint with 3 backup paths as compared to 7 backup paths in LPP A simple algorithm for segmentation: Greedy Approach

19. The Resource advantage

20. Problem with Greedy Approach Need to consider the topology of the network as well

21. An adaptive Algorithm for segmentation Start from the egress and look for longest possible segment

22. End-to-End Delay An important parameter

23. Analysis Max (T + ( t2 – t1 ) ) < EED Bound

24. Algorithm for end-to-end delay For each backup path, we need to make sure that the end-to-end constraint is satisfied Use shortest path approach for finding a backup path – minimizes end-to-end delay

25. Algorithm for end-to-end delay d1d1 d2d2 d3d3 d 1 + d 2 + d 3 d3d3 0 d 2 + d 3 Searching for a backup path

26. Jitter Jitter can be treated as a link property Path Jitter = Σ Link Jitter Algorithm similar to end-to-end delay

27. Combination of above constraints Approach Dynamic Programming Switch Over Time End-to-End Delay Jitter A combined Algorithm for

28. Algorithm based on Dynamic Programming Artificial Node RiRi RjRj RkRk

29. Reliability An important QoS parameter in Computer Networks. Path Reliability : Probability of a path to be in a working state at some instant of time. Link Reliability (p) : Probability of a link to be in working state at some instant of time.

30. Reliability - Objectives Effect of Path Protection on Reliability Effect of Segment Size on Reliability An O(No. of Links + (No. of Segments) 2 ) Algorithm to find exact path reliability ! Algorithm for Finding most reliable Backup Path Heuristics for SBPP with reliability bounds

31. Effect of Path Protection on Reliability Total number of links in primary path = n Reliability of a link : p Path Reliability from A to B = p n A B Path Reliability from A to B with backup path = 2p n – p 2n n links

32. Effect of Path Protection on Reliability

33. Effect of Segment Size on Reliability Total number of links in primary path = n Reliability of a link : p Size of Segments = k Number of Segments = n/k Size of Backup Path = Size of Segment Reliability of the path = (2p k – p 2k ) n/k

34. Effect of Segment Size on Reliability

35. Algorithm to find path reliability Theoretically a path exists between ingress and egress nodes : R1 -> R2 -> R4 -> R5 -> R6 -> R7 No path between ingress and egress nodes in our path switching approach !

36. Algorithm to find path reliability Probability of Primary path for a particular segment S i to be working Probability of Backup path for Segment S i to be working Probability of S i to S j-1 segments’s primary path to be working & segment S j primary path to have an error

37. Algorithm for Finding most reliable Backup Path Artificial Node RiRi RjRj

38. Heuristics for SBPP with reliability bounds Divide any segment into two till the reliability bound is met Find the Segmentation with least number of segments

39. Visualization System

40. Visualization of Algorithms A visualization system developed based on POLKA – an algorithm animation toolkit Closely Integrated with the simulator Aids in understanding how the algorithms work Assists in establishing correctness of algorithms and simulations Dynamic Nature of Visualizations

41. Visualization Two categories of Visualization: –Animation for Adaptive Bounded Switch Over Time Algorithm –Rerouting of packets by SSR in case of failure (packet flow animation) – demonstrates various cases

42. Topology for Visualization

43. Visualization Demo

44. Experimental Results

45. Implementation Simulator developed in C++ for implemented some algorithms Size of model graph : 100 nodes, 1000 edges RTT of each link = 10 ms BW – 50 to 100 Generated large number of random LSP requests and observed various parameters Results indicate advantages of SBPP

46. Segment Size vs BW reserved

47. Segment Size vs Rejection Rate ( for 250 LSPs )

48. No. of Requested LSPs vs Rejection Rate

49. Effect of Backup Path Sharing

50. Crossover - Effects of backup path sharing

51. Effect of additional constraint

53. Bandwidth Reserved vs Density

54. Detection and Notification

55. A Mechanism for Notification After a fault is detected, notification needs to be sent to the SSR for switching the traffic Some nodes will participate in notification and the SSR will switch the route What information will be passed after a fault occurs ? What changes do we need in the LSR tables for switching? Case of Multiple LSPs : All LSPs using that segment may not pass through the faulty node/link – Only concerned LSPs should be switched

56. A Mechanism for Notification

57. Conclusions Fault Tolerance can now be assured to satisfy various QoS constraints Segment Based Algorithms show significant improvement in terms of protection resources used

58. Work Done Mechanisms for Detection, Notification Algorithms for various QoS constraints –Bounded Switch over time –End-to-End delay –Jitter –Combination of above –Reliability Issues relating to backup path - sharing Simulator developed for above Visualization System