Kireeti Kompella draft-kompella-mpls-rmr-01

Slides:



Advertisements
Similar presentations
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 MPLS –TP Fault OAM draft-sfv-mpls-tp-fault-00 George Swallow
Advertisements

Igor Umansky Huub van Helvoort
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 MPLS –TP Fault OAM draft-ietf-mpls-tp-fault-01 George Swallow
Yaacov Weingarten Stewart Bryant Nurit Sprecher Daniele Ceccarelli
MPLS-TP Ring Protection draft-weingarten-mpls-tp-ring-protection
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—2-1 Label Assignment and Distribution Introducing Typical Label Distribution in Frame-Mode MPLS.
MPLS-TP Shared Ring Protection (MSRP) Presenter: Liang Geng (CMCC) Authors: Weiqiang Cheng, L. Wang, H. Li (CMCC) Huub van Helvoort (Hai Gaoming BV) Kai.
Pseudowire Endpoint Fast Failure Protection draft-shen-pwe3-endpoint-fast-protection-00 Rahul Aggarwal Yimin Shen
MPLS additions to RSVP Tunnel identification Tunnel parameter negotiation Routing policy distribution Routing debugging information Scalability improvements.
CS Summer 2003 Lecture 12 FastReRoute (FRR) - Big Picture.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
MPLS and Traffic Engineering
Spatial Reuse Ring Networks Chun-Hung Chen Department of Computer Science and Information Engineering National Taipei University of Technology
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
draft-kompella-mpls-rmr Kireeti Kompella IETF 91
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Control and Traffic Management Paper: Banerjee et al.: ” Generalized multiprotocol label switching: an overview of signaling enhancements and recovery.
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Revision of the Appointed Forwarder RFC draft-eastlake-trill-rfc txt Donald E. Eastlake, 3 rd March 2015 Appointed.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
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.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
The Computer Communication Lab (236340) Winter Resilient Packet Ring GUI Simulator Developed By: Anton Spirkov Slava
P2MP MPLS-TE FRR with P2MP Bypass Tunnel draft-leroux-mpls-p2mp-te-bypass-00.txt J.L. Le Roux (France Telecom) R. Aggarwal (Juniper) IETF 67, MPLS WG,
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.
Protection and Restoration Definitions A major application for MPLS.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Engineering Workshops Purposes of Neighbor Solicitation.
1 IETF-81, MPLS WG, Quebec City, Canada, July, 2011 draft-ali-mpls-inter-domain-p2mp-rsvp-te-lsp-06.txt MPLS WG IETF-81 Quebec City, Canada July, 2011.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
IETF-70th Vancouver1 Extensions to GMPLS RSVP-TE for Bidirectional Lightpath with the Same Wavelength draft-xu-rsvpte-bidir-wave-01 Sugang Xu, Hiroaki.
June 4, 2003Carleton University & EIONGMPLS - 1 GMPLS Generalized Multiprotocol Label Switching Vijay Mahendran Sumita Ponnuchamy Christy Gnanapragasam.
(Slide set by Norvald Stol/Steinar Bjørnstad
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.
GMPLS Recovery Signaling Issues draft-rhodes-rsvp-recovery-signaling-01 Nic Neate Data Connection Ltd (DCL)
Refresh Interval Independent facility FRR draft-chandra-mpls-enhanced-frr-bypass-00 Chandra Ramachandran Yakov Rekhter.
Copyright © 2004 Juniper Networks, Inc. Proprietary and Confidentialwww.juniper.net 1 79th IETF - BeiJing Signaling Extension for MPLS Ring Yong Huang.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Label Distribution Protocols LDP: hop-by-hop routing RSVP-TE: explicit routing CR-LDP: another explicit routing protocol, no longer under development.
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Copyright © 2004 Juniper Networks, Inc. Proprietary and Confidentialwww.juniper.net 1 MPLS Upstream Label Assignment for RSVP- TE and LDP draft-raggarwa-mpls-rsvp-ldp-upstream-
Establishing P2MP MPLS TE LSPs draft-raggarwa-mpls-p2mp-te-02.txt Rahul Aggarwal Juniper Networks.
RSVP Setup Protection draft-shen-mpls-rsvp-setup-protection-00 Yimin Shen (Juniper Networks) Yuji Kamite (NTT Communication) IETF 83, Paris, France.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
1 RSVP-TE Extensions For Fast Reroute of Bidirectional Co-routed LSPs draft-tsaad-mpls-rsvpte-bidir-lsp-fastreroute-00.txt Author list: Mike Taillon
Analysis on Two Methods in Ingress Local Protection.

Zhenbin Li, Li Zhang(Huawei Technologies)
MPLS-TP Survivability Framework
RSVP Setup Protection draft-shen-mpls-rsvp-setup-protection-02
Dynamic Routing Protocols part2
IETF 96 (MPLS WG) Abhishek Deshmukh Kireeti Kompella (presenting)
Extensions to RSVP-TE for P2MP LSP Ingress/Egress Local Protection
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
Dynamic Routing and OSPF
CS 4594 Broadband PNNI Signaling.
IETF 98 (MPLS WG) Abhishek Deshmukh (presenting) Kireeti Kompella
LSP Fast-Reroute Using RSVP Detours
Technical Issues with draft-ietf-mpls-bfd-directed
Virtual LAN (VLAN).
IETF 102 (TEAS WG) Abhishek Deshmukh (presenting) Kireeti Kompella
draft-ietf-mpls-rmr IETF 99 (Prague)
draft-kompella-spring-rmr
Zhaohui (Jeffrey) Zhang
IPFRR WITH FAST NOTIFICATION
Presentation transcript:

Kireeti Kompella draft-kompella-mpls-rmr-01 Resilient MPLS Rings Kireeti Kompella draft-kompella-mpls-rmr-01

New Paradigm: Resilient MPLS Rings Don’t configure LSPs … configure MPLS rings Don’t configure and signal n(n-1) LSPs … LSPs come up on their own LSPs on rings don’t need EROs Don’t configure bandwidths … bandwidths are deduced from traffic or services Don’t configure protection paths, bypass LSPs or detours … protection happens naturally Don’t configure hierarchical LSPs … hierarchy happens automatically

Configuring an MPLS Ring Two ring masters candidates are configured with Ring ID (17) Nothing else is configured! Interfaces are unnumbered (no configuration); interfaces between ring neighbors are automatically bundled The IGP is used to discover ring neighbors, ring interfaces and “optical bypass” links 17 17 unidentified ring link bypass link non-ring link

Auto-discovery of an MPLS RING Ring nodes configured with an RID advertise this. Other ring nodes learn their RID from their neighbors and advertise this 17 17 announcement 4 7 6 5 8 1 9 2 17 3 A ring master is then elected (in this case, R0) mastership R0, as ring master, decides its CW and AC neighbors, and its ring links. Then R0 identifies its bypass links ring identification This process passes CW to R1, then R2, etc., until R9 unidentified Non-ring links are identified ring link At this point, Ring Identification is complete, and signaling begins bypass link non-ring link

Note: A “Ring” network may contain more than one choice of Rings In the example we have been considering, there are actually two maximal rings that could be constructed (and several other non-maximal rings) In this choice, nodes 2 and 3 have changed places, and ring links and bypass links have also changed This choice is made by each node during the ring identification phase This choice can be guided by setting the IGP metrics on the links appropriately In any case, all ring nodes will know the choices made via IGP advertisements 1 3 2 4 unidentified ring link bypass link non-ring link

These LSPs are not configured! Ring LSPs: Basics 17 17 1 Each ring node initiates a bidirectional and multipoint-to-point ring LSP. E.g., ring LSP RL1 starts and ends on R1. Every node can be an ingress for RL1. The egress for RL1 is R1. Each node can send traffic to R1 either clockwise (CW) or anticlockwise (AC) or both. R4 sends traffic AC; R6 sends CW Similarly, there is a ring LSP for each ring node R0, R1, R2, …, R9. 17 2 17 9 CW AC 17 8 17 3 17 7 17 4 17 6 17 5 These LSPs are not configured!

R2 sends a Resv message AC to establish the CW component of RL2 Ring LSPs: Signaling Path messages are automatically sent when an MPLS ring is configured, not because of specific LSP configuration. 17 10 17 1 17 2 17 9 R2 sends a Resv message AC to establish the CW component of RL2 17 8 17 3 R2 at the same time sends a Path message CW, to establish the AC component of RL2. 17 7 17 4 R2 doesn’t wait for the Path message to reach before sending its Resv message! 17 6 17 5 Similarly, all ring nodes send Path and Resv messages for their ring LSP The receipt of a Path or Resv message triggers sending one to the next node

Ring LSPs: PROTECTION Since ring LSP 1 is bidirectional, there is a path from node 8 to node 1 in both directions, US (via node 9) and DS (via node 7). This is used to protect ring LSP 1, say from node 6 to node 1. If the link between node 8 and node 9 fails, traffic to node 1 is immediately put on the reverse LSP to node 1. When the notification of the failure propagates to node 7, the traffic for node 1 is diverted at node 7 to the upstream direction. When node 6 learns, it sends the traffic US to node 1. Effectively, the traffic has switched to the other direction. 17 10 17 1 17 2 17 9 17 8 17 3 17 7 17 4 17 6 17 5 DS US

Protection (2) For RL1, failure of the link between R8 and R9 is equivalent to the failure of node R8 or node R9 However, the failure of node R1 for RL1 is very different The egress node is down. Recovery has to be via an alternative node that with the same connectivity or service Recovery as described in the previous slide will lead to a packet loop. Some solutions for this have been suggested in the draft Details of egress node protection will be given later

OAM To ensure fast detection of failures, OAM is run automatically on each ring link and bypass link Each node advertises the OAM protocols it supports On each ring link and bypass link, the OAM protocol used is one that both nodes agree to, with a default hello time of 3.3ms Each ring node sends an OAM message over its own ring LSP in both the CW and AC directions, with a default hello time of 1 sec

Status Added an author – Luis Contreras/Telefonica Lots of discussion on mailing list Mail from Loa on whether MPLS WG should work on rings Response: yes, MPLS should work on rings Response: no, draft-cheng and RMR should not be merged Request: make draft-kompella-mpls-rmr a WG document