Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde shraddha@juniper.net.

Slides:



Advertisements
Similar presentations
G : DCM Signaling Mechanism Using GMPLS RSVP-TE ITU-T Workshop on IP-Optical, Chitose, Japan 7/11/2002 Dimitrios Pendarakis, Tellium, Inc. ITU-T.
Advertisements

Deployment of MPLS VPN in Large ISP Networks
1 © 2000, Cisco Systems, Inc. Integrated-ISIS Route Leaking.
© 2010 Cisco and/or its affiliates. All rights reserved. 1 Segment Routing Clarence Filsfils – Distinguished Engineer Christian Martin –
CS Summer 2003 Lecture 14. CS Summer 2003 MPLS VPN Architecture MPLS VPN is a collection of sites interconnected over MPLS core network. MPLS.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
COS 420 Day 16. Agenda Finish Individualized Project Please Have Grading sheets to me by Tomorrow Group Project Discussion Assignment 3 moved back to.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Óscar González de Dios PCE, the magic component of Segment Routing Telefónica I+D.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—5#-1 MPLS VPN Implementation Configuring OSPF as the Routing Protocol Between PE and CE Routers.
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
BGP Link-State extensions for Segment Routing
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Inter-area MPLS TE Architecture and Protocol Extensions
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
Draft-li-rtgwg-igp-ext-mrt-frr-00IETF 85 RTGWG1 Applicability of LDP Multi-Topology for Unicast Fast-reroute Using Maximally Redundant Trees draft-li-rtgwg-ldp-mt-mrt-frr-01.
Extended procedures and Considerations for Loop Free Alternatives draft-chunduri-rtgwg-lfa-extended-procedures-01 Uma Chunduri Ericsson Inc. Jeff Tantsura.
Segment Routing Traffic Engineering
Konstantin agouros Omkar deshpande
Requirements for LER Forwarding of IPv4 Option Packets
Connecting MPLS-SPRING Islands over IP Networks
draft-patel-raszuk-bgp-vector-routing-01
Instructor Materials Chapter 5: Dynamic Routing
Update on Advertising L2 Bundle Member Link Attributes in IS-IS
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Zhenbin Li, Kai Lu Huawei Technologies IETF 98, Chicago, USA
BGP-Based SPF RTGWG - Jan 2017
IETF 67, MPLS WG, San Diego 11/08/2006
Jean-Philippe Vasseur – Cisco Systems Raymond Zhang - Infonet
OpenDaylight BGP Use-Cases
Multi-Instances ISIS Extension draft-ietf-isis-mi-08.txt
Segment Routing (SR) Introduction and Tutorial
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
Presenter: Jeffrey Zhang
Multi Topology Routing (MTR) for OSPF
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
DCI using TRILL Kingston Smiler, Mohammed Umair, Shaji Ravindranathan,
A Scalable Multipath Algorithm in Hierarchical MPLS Networks
Virtual LANs.
Explicitly advertising the TE protocols enabled on links in OSPF
Intra-Domain Routing Jacob Strauss September 14, 2006.
Chapter 5: Dynamic Routing
MPLS Traffic Engineering
Link State on Data Center Fabrics
Explicitly advertising the TE protocols enabled on links in ISIS
CHAPTER 8 Network Management
N. Kumar, C. Pignataro, F. Iqbal, Z. Ali (Presenter) - Cisco Systems
Zhenbin Li, Shunwan Zhuang Huawei Technologies
IETF South Korea PCEP Link-State extensions for Segment Routing draft-li-pce-pcep-ls-sr-extension-01 Zhenbin Li (Huawei) Xia Chen (Huawei) Nan.
Segment Routing.
draft-barth-pce-association-bidir-01
Network-automatic-optimization
SDN Controllers in the WAN
Fast Reroute for Node Protection in LDP- based LSPs
BGP-Based SPF IETF 98, Chicago
IS-IS VPLS for Data Center Network draft-xu-l2vpn-vpls-isis-02
Computer Networks Protocols
Achieving Resilient Routing in the Internet
FlexE Design Team Presenter: Mach
draft-filsfils-spring-segment-routing-policy-00
IP RSVP-TE: Extensions to RSVP for P2P IP-TE LSP Tunnels Tarek Saad, Juniper Networks Vishnu Pavan Beeram, Juniper.
Multicasting Unicast.
Scope and Approach of ONF OIMT Internet Protocol Work Items
Preferred Path Routing (PPR) Updates
Supporting Flexible Algorithm Prefix SIDs in LSP Ping/Traceroute
IETF105 IS-IS V6/MT Deployment Considerations draft-chunduri-lsr-isis-mt-deployment-cons-02 Uma Chunduri [Futurewei] Jeff Tantsura [Apstra] Shraddha Hegde.
Inter-AS OAM for SR Networks IETF 105, Montreal
Presentation transcript:

Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde shraddha@juniper.net Arkadiy Gulko arkadiy.gulko@thomsonreuters.com

Use Case MPLS based Dual Plane with common control plane -single IGP To support the following L3 VPN Unicast Services: Optimized based on SPF loosed path per plane No rerouting via inter- plane link (shunt) Specific Plane traffic MUST be dropped if plane is partitioned. Optimized based on SPF loosed path via any planes Traffic stays within a plane and Allowed to be rerouted via shunt links if the plane is partitioned. Ability to fast-recover (TI-LFA) from a network node or link failure within a Service constrains above.

Requirements Maintain strict routing within routing planes. Allow traffic to failover within routing plane and do not allow traffic to failover to other planes. Achieve ease of configuration and operational management. ~50ms recovery from a network node or link failure.

Problem Statement None of the currently available techniques fully meet all of the requirements. Using Node-Admin tags to color each of the planes separately, Using Separate Anycast-SIDs - one per plane,  Multi-Topology (MT)-SIDs. Worth to mention about end to end ERO as another alternative, however deep label stack is a problem for current hardware and software. Thus it is out of scope for further discussion.

Node-Admin tags issues Node –Admin tags approach is part of SR-TE Policy-based Routing PCE or Head-end conducts path validation based on defined constraints, in dual plane design it is based on specific resource avoidance. Problems: TI-LFA will take traffic to alternative plane if plane got partitioned. High bandwidth flows saturate the alternative plane until path invalidation takes effect. Complex traffic-engineering approach

Anycast-SID issues Anycast SID is primarily used to steer traffic via shortest-path towards the topologically nearest node in a group of potential receiving devices. The Anycast SID label has served its purpose once the packet has reached any node in the plane with anycast SID. Anycast label popped and next label will be used to reach the destination. In the dual plane design Anycast SID inherit absolutely the same function as Node-Admin tag, just instead of 32bit color tag PCE would use per color SID label to perform path validation. Problems: Exactly the same as for Node-Admin tag.

Multi-topology-SID issues Multi topology Routing defines mechanisms to support multiple topologies in a single physical network. All the nodes in the network compute separate SPF per MT-ID and program the forwarding planes with MT-SIDs accordingly. This technology meets majority of dual plane requirements and provides additional benefits to assign different IGP costs to links for different MTs. Problems: MT associated with operational overhead. Need to maintain separate IGP topology and complexity of mapping services to different topologies. Additional protocol overheads to advertise MT related information.

Proposed Solution To introduce new SID -Routing Plane (RP)- SID RP- SID is defined and associated with new algorithm values. This document proposes 4 new algorithm values which represent SPF in routing-planes. OSPF Router Information (RI) TLVs Registry 8 (IANA Preallocated) - SR-Algorithm TLV Algorithm 2 -5 : SPF in routing plane ISIS Sub TLVs for Type 242 Type: TBD (suggested value 19) Description: Segment Routing Algorithm Algorithm 2-5 : SPF in Routing Plane

Proposed Solution Routing Plane (RP)- SID solution-based on per plane SPF algorithm for reachability within a plane. Specific RP-SID would never be known via alternative plane, based on principle that any node will ignore the RP-SID received from remote node with an algorithm value that such remote node has not advertised. Example below based on ISIS ( node SIDs and default Algo advertisements are not shown)

Mutli-Level/Area Support The Routing Plane SIDs MAY be re-originated from one IGP domain into the other domain by the border routers. The border IGP routers MUST re-advertise the Routing-Plane SIDs with its related Algorithms if they belong to the corresponding Routing plane and has advertised the algorithm corresponding to the routing-plane.

Service Provisioning

BGP DC Use Case Support for the advertisement and consistent filtering of RP- SIDs via BGP-LU for dual plane end to end provisioning. ( BGP-LU within a DC-Fabric and ISIS within a core). It is desired to constrain LSPs to a sub-set of Spine switches (e.g., only those Spine switches which are 'coloured' RED). No SR-TE required to support end to end diverse paths. Segmented LSP over RED plane use case is only shown below; Single Transport Label!

RP-SID Limitations Additional SID need to be advertised The solution is restricted to this use-case with routing-planes and will not accommodate other TE constraints like link colors/te-metric etc

Summary/ Conclusion RP-SID MT-SID Anycast SID Node-admin tag Prevention of traffic failover to different plane Yes No Additional SID No Additional protocol overheads NO (BGP-SR-TE, PCEP needed for e-2-e solution) No (BGP-SR-TE, PCEP needed for e-2-e solution) No Operational overheads

Thank you! Questions/Comments?