An Efficient Recovery A pproach for Protection LSP Supervisor Professor : 林振緯 Speaker : 蘇文宏

1. An Efficient Recovery Approach for Protection LSP Supervisor Professor :林振緯 Speaker : 蘇文宏 Computer Science and Information Engineering Department Fu Jen Catholic University

2. Outline • Abstract • Introduction-MPLS Recovery Mechanisms • Recovery Time Model • My New Efficient Recovery Approach • Conclusion and Future Work • Reference

3. Abstract • A next generation backbone architecture. • “Fault Recovery” has become an important research in MPLS. • IETF has made strict definitions for MPLS Recovery in RFC 3469 in February,2003. • The paper propose An Efficient Recovery Approach to handle fault recovery,we finally compare other approachs and demonstrate our proposed approach by several experiments is better.

4. Introduction-MPLS Recovery Mechanisms • There are three options for the “Initiation of the recovery path setup[1]:” • 1.Pre-Established. • 2.Pre-Qualified. • 3.Established-on-Demand.

5. Introduction-MPLS Recovery Mechanisms(cont.)

6. Introduction-MPLS Recovery Mechanisms(cont.) • There are two main options for the “Topology of recovery”[1]: • 1.Local Repair. • 2.Global Repair.

7. Introduction-MPLS Recovery Mechanisms(cont.) • 1.Local Repair(Link Recovery or Node Recovery). 2 3 7 Link Recovery Break 0 1 4 6 9 10 2 3 7 Node Recovery Break 0 1 4 6 9 10

8. Introduction-MPLS Recovery Mechanisms(cont.) • 2.Global Repair. 2 3 7 FIS Break Break 0 1 4 6 9 10 PML (Egress) POR/PSL (Ingress)

9. Introduction-MPLS Recovery Mechanisms(cont.) • Local-to-Egress Repair[2] 2 3 7 Break Break 0 1 4 6 9 10

10. Introduction-MPLS Recovery Mechanisms(cont.) • There are two options for the “Recovery Model”[1]: • 1.Rerouting. • Recovery by rerouting is defined as establishing new paths or path • segments on demand for restoring traffic after the occurrence of a • fault. • 2.Protection Switching. • pre-establish a recovery path or path segment, the recovery path may or may not be link and node disjoint with the working path, a fault is detected, the protected traffic is switched over to the recovery path(s) and restored.

11. Introduction-MPLS Recovery Mechanisms(cont.)

12. Introduction-MPLS Recovery Mechanisms(cont.) • Proposed approach presently: • Haskin Approach[3]. • Makam Approach[4]. • Das Approach[5]. • Hundessa Approach[6]. • RSVP Approach[7]. • Yoon Approach[8]. • Dynamic Approach[9].

13. Introduction-MPLS Recovery Mechanisms(cont.) • Haskin Approach. 2 3 7 Break Break 0 1 4 6 9 10 PML (Egress) POR/PSL (Ingress)

14. Introduction-MPLS Recovery Mechanisms(cont.) • Makam Approach. 2 3 7 FIS Break 0 1 4 6 9 10 PML (Egress) POR/PSL (Ingress)

15. Introduction-MPLS Recovery Mechanisms(cont.) • Das Approach. FIS FIS 2 3 7 FIS FIS FIS Break 0 1 4 6 9 10 PML (Egress) POR/PSL (Ingress) 6 Temporary backup path

16. Introduction-MPLS Recovery Mechanisms(cont.) • Hundessa Approach(Improve Haskin Approach). Tag Break 1 2 Tag Buffer POR/PSL (Ingress) Working path Backup path

17. Introduction-MPLS Recovery Mechanisms(cont.) • RSVP Approach. 2 3 7 Break 0 1 4 6 9 10 PML (Egress) POR/PSL (Ingress)

18. Introduction-MPLS Recovery Mechanisms(cont.) • Yoon Approach. 2 3 7 10 Break 0 1 4 6 9 PML (Egress) POR/PSL (Ingress) 11 5 8

19. Introduction-MPLS Recovery Mechanisms(cont.) • Dynamic Approach. 2 3 7 Break 0 1 4 6 9 10

20. Introduction-MPLS Recovery Mechanisms(cont.)

21. Recovery Time Model [9]

22. Recovery Time Model(cont.) [9] [9]

23. Recovery Time Model(cont.) (1) (4) (2) (5) (6) (3) [9]

24. My New Efficient Recovery Approach 2 3 7 10 Break 0 1 4 6 9 PML (Egress) POR/PSL (Ingress) 11 5 8

25. 時程 進度 暑假 完成NS2 模擬 研二(上) 目標：發表一篇Conference paper 研二(下) 論文 Conclusion and Future Work(cont.) Future work(Schedule)

26. Reference 1.V.Sharma, F.HellstrandAndersson, , “Framework for Multi-Protocol Label Switching (MPLS)-based Recovery”, RFC 3469, February 2003. 2. A. Autenrieth and A. Kirstadter, “Engineering End-to-End IP Resilience Using Resilience-Differentiated QoS,” IEEE Communication Magazine, Volume 40,Issue 1, January 2002, pp.50-57. 3. D. Haskin and R. Krishnan, “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute,” Internet-Draft (draft-haskin-mpls-fast-reroute-05.txt), November 2000. 4.S.Makam, V.Sharma, K.Owens, and C.Huang, “Protection/Restoration of MPLS Networks,” Internet-Draft (draft-makam-mpls-protection-00.txt), October 1999. 5.S.K. Das and P. Venkataram, “A method of Designing a path restoration scheme for MPLS based network”, High Speed Networks and Multimedia Communications 5th IEEE International Conference on, 2002, pp.218-222.

27. Reference(cont.) 6.L. Hundessa and J. D. Pascual, “Fast Rerouting Mechanism for Protected Label Switched Path”, IEEE Computer Communications and Networks, 2001.Proceedings. Tenth International Conference on 2001, pp.527-530. 7.Ping Pan, Der-Hwa Gan, George Swallow, Jean Philippe Vasseur, Dave Cooper,Alia Atlas and Markus Jork, “Fast Reroute Extensions to RSVP-TE for LSP “,Internet draft <draft- ietf-mpls-rsvp- lsp- fastreroute-02.txt>, work in progress. 8.Sangsik Yoon, Hyunseok Lee, Deokjai Choi, Youngcheol Kim, Gueesang Lee and Lee M., “An efficient recovery mechanism for MPLS-based protection LSP”,IEEE International Conference on, 2001, pp. 75-79. 9.G. Ahn, and W. Chun, “Simulator for MPLS Path Restoration and Performance Evaluation”, IEEE, 2001.

28. Reference(cont.) 10.Achim Autenrieth,”Recovery Time Analysis of Differentiated Resilience in MPLS”,Design of Reliable Communication Networks(DRCN)2003,Banff,Alberta,Canada,October 19-22,2003