draft-kompella-mpls-rmr Kireeti Kompella IETF 91

Slides:



Advertisements
Similar presentations
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Advertisements

© 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
New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
MPLS - 75th IETF Stockholm1 Composite Transport Group (CTG) Framework and Requirements draft-so-yong-mpls-ctg-framework-requirement-02.txt draft-so-yong-mpls-ctg-framework-requirement-02.txt.
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.
Draft-chen-i2rs-mpls-ldp-usecases-00/ draft-huang-i2rs-mpls-te-usecase-00 IETF 88 I2RS1 Use Cases for an Interface to MPLS Protocol draft-chen-i2rs-mpls-ldp-usecases-00/
CS Summer 2003 Lecture 12 FastReRoute (FRR) - Big Picture.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
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.
Introduction to MPLS and Traffic Engineering
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.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
November th Requirements for supporting Customer RSVP and RSVP-TE over a BGP/MPLS IP-VPN draft-kumaki-l3VPN-e2e-mpls-rsvp-te-reqts-05.txt.
MPLS - 73nd IETF Minneaplis1 Composite Transport Group (CTG) Framework and Requirements draft-so-yong-mpls-ctg-framework-requirement-00.txt draft-so-yong-mpls-ctg-framework-requirement-00.txt.
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.
IETF 68, MPLS WG, Prague P2MP MPLS-TE Fast Reroute with P2MP Bypass Tunnels draft-leroux-mpls-p2mp-te-bypass-01.txt J.L. Le Roux (France Telecom) R. Aggarwal.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
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.
U-Turn Alternates for IP/LDP Local Protection draft-atlas-ip-local-protect-uturn-00.txt Alia Atlas Gagan Choudhury
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.
Inter-Area P2MP Segmented LSPs draft-raggarwa-seamless-mcast-03.txt
MPLS WG1 Targeted mLDP Base mLDP spec didn’t consider use of LDP multipoint extensions over Targeted mLDP sessions LDP speaker must choose “upstream LSR”,
Kireeti Kompella draft-kompella-mpls-rmr-01
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
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.
IP Traffic Engineering RSP draft-shen-ip-te-rsp-01.txt Naiming Shen Albert Tian Jun Zhuang
RSVP-TE Extensions to Establish Associated Bidirectional LSP MPLS/CCAMP WG, IETF 81th, Quebec draft-ietf-ccamp-mpls-tp-rsvpte-ext-associated-lsp-01 Fei.
GMPLS Recovery Signaling Issues draft-rhodes-rsvp-recovery-signaling-01 Nic Neate Data Connection Ltd (DCL)
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.
Precision Time Protocol over MPLS draft-ronc-ptp-mpls-00.txt PWE3 WG IETF Chicago 2007 Ron Cohen
Establishing P2MP MPLS TE LSPs draft-raggarwa-mpls-p2mp-te-02.txt Rahul Aggarwal Juniper Networks.
February 2006 MPLS Interop 2008 # 1 MPLS-TP OAM OAM for an MPLS Transport Profile Loa Andersson, Acreo AB IAB, MPLS WG co-chair.
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
83rd IETF – Paris, France IJ. Wijnands E. Rosen K. Raza J. Tantsura A. Atlas draft-wijnands-mpls-mldp-node-protection-00
Extensions to RSVP-TE for LSP Ingress Local Protection draft-ietf-teas-rsvp-ingress-protection-04 Huaimo Chen, Raveendra Torvi Autumn Liu, Tarek Saad,
1 MPLS Source Label Mach Chen Xiaohu Xu Zhenbin Li Luyuan Fang IETF87 MPLS Aug Berlin draft-chen-mpls-source-label-00.
Analysis on Two Methods in Ingress Local Protection.
RSVP Setup Protection draft-shen-mpls-rsvp-setup-protection-03
Inter domain signaling protocol
RSVP Setup Protection draft-shen-mpls-rsvp-setup-protection-02
IETF 96 (MPLS WG) Abhishek Deshmukh Kireeti Kompella (presenting)
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
Fast Reroute for Node Protection in LDP- based LSPs
CHAPTER 8 Network Management
Kireeti Kompella Juniper Networks
CS 4594 Broadband PNNI Signaling.
IETF 98 (MPLS WG) Abhishek Deshmukh (presenting) Kireeti Kompella
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
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.
Fast Reroute for Node Protection in LDP- based LSPs
IS-IS VPLS for Data Center Network draft-xu-l2vpn-vpls-isis-02
IETF 102 (TEAS WG) Abhishek Deshmukh (presenting) Kireeti Kompella
draft-kompella-spring-rmr
Presentation transcript:

draft-kompella-mpls-rmr Kireeti Kompella IETF 91 Resilient MPLS Rings draft-kompella-mpls-rmr Kireeti Kompella IETF 91

Using MPLS in Ring Topologies A ring is the most efficient topology that offers resilience … … but MPLS resilience in rings is far from efficient Rings are often used in access and aggregation where bandwidth is precious … … but pre-assigning bandwidth may be wasteful Rings are a simple topology, and there are lots of them … … so configuring them should be as simple as possible

MPLS for Ring Transport The goal here is to identify and address issues in running MPLS as a transport protocol in access rings Basically, to do what MPLS-TP set out to do, to replace TDM with packet, but in an efficient way To achieve this, we use IGP for ring discovery and RSVP-TE or LDP for signaling – but in a new way Some of the differences from “traditional” signaling will be explained

Illustrations of Issues with MPLS in Rings Can’t be helped LDP: Rings are absolutely the worst topology for LFA! RSVP-TE So bad! Consider all the extensions to the base LFA technique that there are to get to 100% coverage! Original LSP Protection path Re-signaled LSP

Bandwidth Allocation 7G LSP Assume a 10G ring. If 7G is allocated for the purple LSP, then the green LSP can only have 3G. Is this the best allocation? Hard to say until the services using these LSPs are known. For example, if the 7G LSP is not fully utilized, and more bandwidth is needed for the 3G LSP, both LSPs have to be disrupted to adjust the bandwidth!

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; no need for 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 17 R0 17 R1 What you see here is a ring with ring ID 17 and with 10 nodes R0 to R9 The ring ID is used to uniquely identify a ring within an AS. The IGP is used to discover ring neighbors and ring links. Links between a pair of ring nodes may belong to multiple rings Links between a pair of ring nodes are automatically bundled into a single logical link. 17 R2 17 R9 17 R8 counter- clockwise 17 R3 clockwise 17 R7 17 R4 17 R6 17 R5

Configuring an MPLS Ring SN 17 R0 17 R1 17 R2 17 R9 Note that rings are not “pure” – there will be non-ring links. These can be “optical bypass” links, or links to access or service nodes. Furthermore, there can be hierarchical rings, stacked rings, etc. All these need to be taken into account in ring definition and discovery. 17 R8 17 R3 17 R7 17 R4 17 R6 17 R5 AN ring link non-ring link

Ring Auto-discovery Requirements: ring nodes are assigned to a ring ID Ring links are discovered and “auto-bundled” Non-ring links are identified as such All nodes agree on clockwise and counterclockwise Each node knows its CW and CCW neighbor Node insertion and removal is handled

Similarly, each node R0, R2, R3, …, and R9 has a ring LSP. Ring LSPs: Basics 17 R0 17 R1 A ring LSP starts and ends at the same node – a pair of counter-rotating LSPs. One direction is called clockwise (CW), and the other counterclockwise (CCW). Ring LSP RL1 starts and ends on R1 and is a multipoint LSP with egress R1 Each node can send traffic to R1 either CW (e.g., R6) or CCW (e.g., R4). Similarly, each node R0, R2, R3, …, and R9 has a ring LSP. 17 R2 17 R9 CW CCW 17 R8 17 R3 17 R7 17 R4 17 R6 17 R5 A ring of N nodes has N ring LSPs, not N*(N-1)!

Ring LSPs: Signaling 17 R0 17 R1 Path messages are automatically sent when an MPLS ring is configured, not because of specific LSP configuration. 17 R2 17 R9 Node 2 sends 10 Resv messages CCW, one for each of ring LSPs 1, 2, 3, …, 10. These contain CW labels, and establish the CW LSPs. 17 R8 17 R3 17 R7 17 R4 Node 2 also sends 10 Path messages CW, one for each of ring LSPs 1, 2, 3, …, 10. These contain CCW labels, and establish the CCW LSPs. 17 R6 17 R5

Ring LSPs: Protection 17 R0 17 R1 Since ring LSP RL1 is bidirectional, there is a path from node 8 to node 1 in both directions, CCW (via node 9) and CW (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 on RL1 is diverted at node 7 to the upstream direction. When node 6 learns, it sends the traffic CCW to node 1. Effectively, the traffic has switched to the other direction. 17 R2 17 R9 17 R8 17 R3 17 R7 17 R4 17 R6 17 R5 CW CCW

Ring LSPs: Node Failure 17 R0 17 R1 17 R2 Node (say R1) failure is similar to link failure – stuff just works. Of course, RL1 clearly cannot recover – its egress has failed. However, there is the danger of a loop: R0 protects by sending traffic CCW; R2 protects by sending traffic CW! This can be dealt with by TTL … … or by adding a new ESPL to indicate failure recovery 17 R9 17 R8 17 R3 17 R7 17 R4 17 R6 17 R5 CW CCW

Ring LSPs: Bandwidth Management 17 R0 17 R1 17 R2 17 R9 Ring LSP RL1 starts with 0 bandwidth. As services are provisioned over RL1, their bandwidths are added to the LSP from where they enter the ring to the egress node. Say a 1G PW is provisioned from node 6 to node 1. The LSP attempts to increase the bandwidth from node 6 to node 1. If successful, the service is accepted. Similarly for a 2G PW from node 5 to node 1. The resulting signaled bandwidth in the CW direction for ring LSP 1 is 0 from node 1 to node 5; node 5 signals a bandwidth of 1G; node 6-10 signal a bandwidth of 3G. 17 R8 17 R3 17 R7 17 R4 17 R6 17 R5 1G 2G

Conclusion Rings are indeed a special topology MPLS on rings needs to be: easy from configuration point of view; efficient from protection PoV; more flexible from a bandwidth PoV Ring LSPs appear to meet these requirements Thanks for your questions and comments on the list Please keep them coming!