Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Anna Urra, Eusebi Calle, Jose L Marzo Institute of Informatics.

Slides:



Advertisements
Similar presentations
MPLS and GMPLS Li Yin CS294 presentation.
Advertisements

QoS Strategy in DiffServ aware MPLS environment Teerapat Sanguankotchakorn, D.Eng. Telecommunications Program, School of Advanced Technologies Asian Institute.
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
IETF Differentiated Services Concerns with Intserv: r Scalability: signaling, maintaining per-flow router state difficult with large number of flows r.
Deployment of MPLS VPN in Large ISP Networks
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Designing a New Routing Simulator for DiffServ MPLS Networks Peng Zhang Zhansong Ma Raimo Kantola {pgzhang, zhansong,
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
OLD DOG CONSULTING Traffic Engineering or Network Engineering? The transition to dynamic management of multi-layer networks Adrian Farrel Old Dog Consulting.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
Protection in OBS Zartash Afzal Uzmi. Jan 13, 2006Lahore University of Management Sciences2 First slide… This is not a tutorial! This is a discussion.
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
October 8, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Basics Zartash Afzal Uzmi Computer Science and Engineering Department.
Presented by: Dmitri Perelman Nadav Chachmon. Agenda Overview MPLS evolution to GMPLS Switching issues –GMPLS label and its distribution –LSP creation.
Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
Path Protection in MPLS Networks Ashish Gupta Design and Evaluation of Fault Tolerance Algorithms with Performance Constraints.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
MPLS Protection Routing: A Tutorial Zartash Afzal Uzmi.
MPLS and Traffic Engineering
Restoration Routing in MPLS Networks Zartash Afzal Uzmi Computer Science and Engineering Lahore University of Management Sciences.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Introduction to MPLS and Traffic Engineering
Path Protection in MPLS Networks Using Segment Based Approach.
Introduction to Protection & Restoration for OBS Copyright, 2000, SUNY, Univ. at Buffalo Presented by Zaoyang Guo & Dahai Xu.
Comparison of MSTP and (G)ELS Benchmarking Carrier Ethernet Technologies Workshop Session AI.1: Scientific and Technical Results Krakow, Poland April 30,
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Ashish Gupta (98130) Ashish Gupta (98131) Under guidance of Prof. B. N. Jain.
QoS-Aware Path Protection in MPLS Networks Ashish Gupta Ashish Gupta Bijendra Jain Indian Institute of Technology Delhi Satish Tripathi University of California.
Control and Traffic Management Paper: Banerjee et al.: ” Generalized multiprotocol label switching: an overview of signaling enhancements and recovery.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Implement a QoS Algorithm for Real-Time Applications in the DiffServ-aware MPLS Network Zuo-Po Huang, *Ji-Feng Chiu, Wen-Shyang Hwang and *Ce-Kuen Shieh.
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
1 Fabio Mustacchio - IPS-MOME 2005 – Warsaw, March 15th 2005 Overview of RSVP-TE Network Simulator: Design and Implementation D.Adami, C.Callegari, S.Giordano,
1 Multi Protocol Label Switching Presented by: Petros Ioannou Dept. of Electrical and Computer Engineering, UCY.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Estimation of the Probability of Congestion using Monte Carlo method in OPS Networks Anna Urra, Jose L Marzo, Mateu Sbert, Eusebi Calle Institute of Informatics.
Helsinki 19 May 2006 Fine Protection of Data-Paths in Multi-Layer Networks Based on the GMPLS paradigm G.Oriolo, Università Tor Vergata, Roma joint work.
Multi-Protocol Label Switching University of Southern Queensland.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
IST Project LION 2 Outline IST-project LION –Layers Interworking in Optical Networks –Overview – objectives –Testbed Progress: 2 examples –Recovery experiments.
Draft-shiomoto-ccamp-switch-programming-00 74th IETF San Francisco March Advice on When It is Safe to Start Sending Data on Label Switched Paths.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.
Protection and Restoration Definitions A major application for MPLS.
CSC Survivability Anuj Dewangan Parinda Gandhi.
Two-layer Restoration Scheme for IP over Optical Networks with MPLS Jia Ke, L. Mason, Q. Yang ICIS, School of EEE, Nanyang Technological University
DetNet Data Plane using PseudoWires Jouni Korhonen Shahram Davari Norm Finn IETF#94, Yokohama.
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
Supporting DiffServ with Per-Class Traffic Engineering in MPLS.
(Slide set by Norvald Stol/Steinar Bjørnstad
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
Draft-torvi-mpls-rsvp-ingress-protection-00IETF 84 MPLS: 30 July Ingress Protection for RSVP-TE p2p and p2mp LSPs draft-torvi-mpls-rsvp-ingress-protection-00.
1 68th IETF, Prague, March 2007 Address Resolution for GMPLS controlled PSC Ethernet Interfaces draft-ali-arp-over-gmpls-controlled-ethernet-psc-i-04.txt.
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Survivability in IP over WDM networks YINGHUA YE and SUDHIR DIXIT Nokia Research Center, Burlington, Massachusetts.
MEF Protection Work Pascal Menezes Technical Contributor June 3 rd 2003.
Multi-protocol Label Switching
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
Analysis on Two Methods in Ingress Local Protection.
draft-liu-pim-single-stream-multicast-frr-01
Protection & Restoration Design Team - CCAMP WG
CHAPTER 8 Network Management
Optical Fast Reroute Adrian Farrel : Old Dog Consulting
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Technical Issues with draft-ietf-mpls-bfd-directed
SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)
Eusebi Calle, Jose L Marzo, Anna Urra. L. Fabrega
Presentation transcript:

Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Anna Urra, Eusebi Calle, Jose L Marzo Institute of Informatics and Applications (IIiA) ISCC 2005

Contents Universitat de Girona Background (Fault Management) The failure probability and impact Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Experimental results Summary and conclusions

1. Fault Management 1.1 MPLS/GMPLS fault management. Working LSP Backup LSP PML Node PSL Node Protection Switch LSR (PSL) : switches protected traffic from the working path to the corresponding backup path. Protection Merge LSR (PML) : merges their traffic into a single outgoing LSP, or, if it is itself the destination, passes the traffic on to the higher layer protocols FIS : Fault Indication Signal

1. Fault Management 1.2 Classes of impairments IETF RFC3469 Path Failure (PF)... Path Degraded (PD)... Link Failure (LF) is an indication from a lower layer that the link over which the path is carried has failed. If the lower layer supports detection and reporting of this fault, i.e. any fault that indicates link failure for example SONET Loss of Signal (LoS), this may be used by the MPLS recovery mechanism. Link Degraded (LD)... SINGLE LINK FAILURES Working LSP Backup LSP

1. Fault Management M is the number of backup LSPs used to protect N working LSPs 1:1: 1 working LSP is protected/restored by one backup LSP. M:1: 1 working LSP is protected/restored by M backup LSPs. 1:N: 1 backup LSP is used to protect/restore N working LSPs (shared backups). M:N : N working LSPs are restored by M backup LSPs 1:0 : No protection (for instance, Best effort traffic) 1+1: Traffic is sent concurrently on both the working LSP and the backup LSP. Working Paths Backup Paths 1:1M:11:N M:N0: The M:N model

1. Fault Management 1.4 a) Path provisioning classification 1.4 b) Resource allocation classification Path Provisioning Computed on demand Pre-computed Established on demand Pre-established Resource pre-allocated Resource allocated on demand Resource allocation Dedicated (1:1 or 1+1) Shared (1:N, M:N) No resources (1:0)

Egress Node PML Ingress node PSL Working Path Global Backup Path a) Global Backup Path Advantages Path Protection ( 1 PSL, 1 PML ) Disadvantages Slow Failure Recovery Time Packet Loss 1. Fault Management

Egress Node Ingress node Working Path Global Backup Path b) Reverse Backup Path Reverse Backup Path Advantages Path Protection Low Packet Loss Disadvantages Slow Failure Recovery Time Packet reordering High Resource Consumption 1. Fault Management

Egress Node Ingress node Working Path c) Local Backup Path Local Backup Path Advantages Fast Failure Recovery Time Low Packet Loss Disadvantages High Resource Consumption (Path Protection) 1. Fault Management

1.5.d) Segment Backup Path Egress Node Ingress node Working Path Segment Backup Path AdvantagesDisadvantages 1. Fault Management

1.5.e) 1+1 Protection 1. Fault Management Egress Node Ingress node Path Path 1 Advantages Path Protection Very Low Packet Loss Disadvantages Fast Failure Recovery Time High Resource Consumption

2. Reducing failure probability and impact 2.1. Enhanced Protection using Shared Segment Backups in Multiservice GMPLS-based Networks Drawbacks and lacks No protection considerations -> Secondary routing objective (No specific backup routing information) High complexity (in terms of computation time) High resource consumption (1+1) No traffic differentiation No physical network considerations (availability and reliability) Failure impact (fault recovery time, packet loss…) No Multilevel protection considerations (protection duplications) Objectives Protection as a main routing objective Low complexity Low resource consumption (shared protection) Traffic differentiation Min. Failure Probabilities Reducing Failure Impact Multilevel protection (avoid protection duplications)

Recovery phase Fault detection (T DET ) Hold off time (T HOF ) Notification time (T NOT ) New Backup creation (T BR + T BS ) Backup Activation (T BA ) Switchover (T SW ) Complete recovery (T CR ) Features Depends on the technology Depends on the lower layers Depends on the Failure Notification Distance and notification method Depends on the routing and signaling method applied Depends on the backup distance and signaling cross- connection process Depends on the node technology Depends on the backup distance Time Reduction Cannot be reduced (except in the case of monitoring techniques) Setup (0-50 ms) Minimizing the Failure Notification Distance and optimizing the process Pre-establishing the backup Minimizing the backup distance and optimizing the process Cannot be reduced Minimizing the backup distance 2.3 Minimization of the Failure Recovery Time (Failure Impact) 2. Reducing failure probability and impact Failure NotificationTime Node and link delays to transmit the Failure Indication Signal (FIS) Link Delay : Tprop and Ttrans Node Delay : Queueing and processing time Working LSP Backup LSP Tprop (2000 km) = 10 ms

Residual Label Switch Path Failure Probability LFP = 1·10 -4 LFP = 4·10 -4 Working path RFP = (1+4)= 5 Working path Local Backup RFP = 1 Working path Local Backup s RFP = 0 Working path Segment Backup RFP = 0 Working path Global Backup RFP = 0 Working path RFP = 0 2. Reducing failure probability and impact LFP = 0 (WDM protected)

Protected Traffic services  High-resilience requirement traffic services : Traffic that is very sensible to network faults (like EF diffserv traffic). Residual Failure probability and Failure Impact values should be set up at zero. 1+1 or local backup paths can be used in order to accomplish these values.  Medium-resilience requirement traffic services : Traffic that is sensible to network faults (like AF1 or AF2 diffserv traffic). However, resource consumption should be taken into account to route the working and backup paths. Residual failure probabilities and failure impact values should be bounded in order to achieve the desirable QoS with appropriate resource consumption. Segment and global backups can be used to protect these services. Non-Protected Traffic services  None-resilience requirement traffic services. No protection requirements are needed (BE traffic). Protection assignment for class types based on the network failure probability and failure impact 2.7 GMPLS Protection with traffic differentiation 2. Reducing failure probability and impact

3.1 Selecting the LSP protected segments 3. Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks WP link (WDM non protected) Segment BackupWP link (WDM protected) (10 -4 )

3.1 Proposed algorithms 3. Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks Segment protection FRRM_F1 : FRRM with FIR and 1 Level of protection. This scheme considers that the FIR computes the backup path when the candidates are selected. FRRM_W1 : FRRM with WSP and 1 Level of protection. This algorithm considers that the WSP computes the backup path. FRRM_F2 : FRRM with FIR and 2 Level protection. This scheme considers that the FIR computes the backup path when the candidates are selected. In this scheme one-level algorithm is not applied. FRRM_W2 : FRRM with WSP and 2 Level protection. In this scheme, one-level algorithm is not applied and the WSP computes the backup path. Global/path protection G_WSP and G_FIR.

4. Experimental results

Restoration Overbuild a) b) c)c) d)d) Time Trial % of non protected WDM links Restoration Overbuild Level of Sharing FRRM_W2FRRM_F2 G_FIRG_WSP FRRM_F1FRRM_W1 FRRM_W1 (AF) FRRM_F1 (AF) FRRM_W1 (EF) FRRM_F1 (EF) FRRM_F1 FRRM_W1 FRRM_F1 FRRM_W1

5. Summary and conclusions 5.1 Summary and conclusions In this paper novel protection schemes for Fast Recovery and Reliable Multiservices (FRRM) label switch paths have been presented in a GMPLS scenario with traffic differentiation. The tradeoffs between the minimization of the recovery time and failure probabilities with suitable resource consumption have been considered. Using shared segment backup paths allows the reliability and failure impacts required for each traffic service to be supported. For each working path only one backup path is computed, simplifying fault management and the routing schemes. Shared backups also optimize resource consumption. Another interesting contribution is that the FRRM algorithms avoid protection duplication by considering those segments already protected at the WDM layer. The results also show that FRRM algorithms perform suitably in different network scenarios with varying amounts of WDM protected segments.

ISCC 2005 Eusebi Calle, Jose L Marzo, Anna Urra Thank you ! Enhanced Protection using Shared Segment Backups in a Multiservice GMPLS-based Networks