PIM-BIDIR RP Resiliency Jeffrey Zhang, Kurt Windisch, Jaroslaw Adam Gralak Juniper Networks 88 th IETF, Vancouver.

Slides:



Advertisements
Similar presentations
OSPF 1.
Advertisements

SHIM6 Update Geoff Huston Kurtis Lindqvist SHIM6 co-chairs.
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Chapter 2 – Single Area OSPF Single Area OSPF Link State Routing.
CCNP 1: Advanced Routing
OSPF Two-part Metrics Jeffrey Zhang Lili Wang Juniper Networks 88 th IETF, Vancouver.
Introduction to OSPF.
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
BY MICHAEL SUDKOVITCH AND DAVID ROITMAN UNDER THE GUIDANCE OF DR. GABI NAKIBLY OSPF Security project: Summary.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
OSPF Stub neighbor Draft Faraz Shamim – Cisco Padma Pillay-Esnault – Cisco Khalid Raza – Viptela Andrew Kulawiak – Bank of America John Cavanaugh – 405.
OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 90 th IETF, Toronto.
Courtesy: Nick McKeown, Stanford
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public BSCI Module 7 Lesson 3 1 IP Multicasting: Multicast Routing Protocols.
Nov 11, 2004CS573: Network Protocols and Standards1 IP Routing: OSPF Network Protocols and Standards Autumn
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
RD-CSY /09 Distance Vector Routing Protocols.
OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 89 th IETF, Landon.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Computer Networks Layering and Routing Dina Katabi
Network Redundancy Multiple paths may exist between systems. Redundancy is not a requirement of a packet switching network. Redundancy was part of the.
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
Routing and Routing Protocols Dynamic Routing Overview.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
6: Routing Working at a Small to Medium Business.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
CS551: Unicast Routing Christos Papadopoulos (
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583.
IP Multicast Lecture 3: PIM-SM Carl Harris Communications Network Services Virginia Tech.
Network Architecture and Design
Computer Science 6390 – Advanced Computer Networks Dr. Jorge A. Cobb Deering, Estrin, Farinacci, Jacobson, Liu, Wei SIGCOMM 94 An Architecture for Wide-Area.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
U-Turn Alternates for IP/LDP Local Protection draft-atlas-ip-local-protect-uturn-00.txt Alia Atlas Gagan Choudhury
Lecture 2 Agenda –Finish with OSPF, Areas, DR/BDR –Convergence, Cost –Fast Convergence –Tools to troubleshoot –Tools to measure convergence –Intro to implementation:
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Distance Vector Routing Protocols Dynamic Routing.
1 OSPF in Multiple Areas. 2 2 Scalability Problems in Large OSPF Areas Scalability problems in large OSPF areas include Large routing tables Large routing.
LINK STATE ROUTING PROTOCOLS Dr. Rocky K. C. Chang 22 November
1 Multicast Routing Blackhole Avoidance draft-asati-pim-multicast-routing-blackhole-avoid-00 Rajiv Asati Mike McBride IETF 72, Dublin.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—2-1 BGP Transit Autonomous Systems Forwarding Packets in a Transit AS.
OSPF Hybrid Broadcast and P2MP Interface Type Nischal Sheth, Lili Wang, Jeffrey Zhang Juniper Networks 81th IETF, Quebec City.
Release 5.1, Revision 0 Copyright © 2001, Juniper Networks, Inc. Advanced Juniper Networks Routing Module 3: OSPF NSSA.
L3VPN WG2012-Jul-301 Bidirectional P-tunnels in MVPN Bidirectional P-tunnel: MP2MP LSP per RFC 6388 PIM MDT per RFC 5015, GRE Encapsulation Accommodated.
Draft-chandra-ospf-manet-ext-01.txtIETF 60 draft-chandra-ospf-manet-ext-01.txt IETF 60.
Engineering Workshops 96 ASM. Engineering Workshops 97 ASM Allows SPTs and RPTs RP: –Matches senders with receivers –Provides network source discovery.
Avoiding Unnecessary Upstream Traffic in Bidir-PIM Jeffrey Zhang Weesan Lee Juniper Networks 82th IETF, Taipei.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
CCNA 3 Chapter 3 Single-Area OSPF
Presentation_ID © 2003, Cisco Systems, Inc. All rights reserved
Default Router Preferences and More-Specific Routes in RAs
Routing Jennifer Rexford.
Multicast Outline Multicast Introduction and Motivation DVRMP.
Ingress Filtering, Site Multihoming, and Source Address Selection
Support C-Bidir with Ingress Replication draft-zzhang-l3vpn-mvpn-bidir-ingress-replication Jeffrey Zhang Yakov Rekhter Andrew Dolganow 87th IETF, Berlin.
IP Multicast Fast Reroute follow-up on draft-dimitri-rtgwg-mfrr-framework-00 RTG Working Group IETF 75 meeting Stockholm (Sweden) July 2009.
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
Dynamic Routing and OSPF
draft-pim-with-ipv4-prefix-over-ipv6-nh
COMP/ELEC 429/556 Introduction to Computer Networks
Computer Networks Protocols
draft-ietf-pim-ipv4-prefix-over-ipv6-nh
Presentation transcript:

PIM-BIDIR RP Resiliency Jeffrey Zhang, Kurt Windisch, Jaroslaw Adam Gralak Juniper Networks 88 th IETF, Vancouver

PIM-BIDIR Pros & Cons Simple, powerful and scalable – 100% control-driven, no data events – RPT only, no source states, no RPT->SPT switch – No registration/encapsulation needed native forwarding via RPL – Some RP resiliency built in Single Point of Failure (RPL) – somewhat

Existing RP Resiliency Traffic converges toward the RPA and get exchanged at the routers on the path closest to the sender and receiver RPA can be a just a reachable address – Not a real router no single point of failure at router level As long as RPL is not partitioned itself, or partitioned from some parts of the network, things will work fine

Partitioned RPL RPA R1 R6 R5 R4 R2 R3 R7 R8 src rcv1 rcv3 rcv2 data join RPL ?? What if R3 & R4 realize that RPL is partitioned so it stops treating it as RPL, and sends join towards R2?

Deal with RPL Partitioning Detect partitioning and elect one partition as active partition to act as RPL Routers on the active partition advertise host route for RPA – R1~R4 all do so before/without the partition R3/R4 stops advertising that after the partition – Ensure optimal path towards the RPA (via host route) Routers on the in-active partition subnet stops treating it as RPL – DF election, among other things

Detection & Election via IGP One or more DRs and Net LSAs for the RPL subnet – Potentially one or more Stub links as well From routers that are not adjacent to the DR – One for each partition Routers on the RPL subnet pick the lowest Advertising Router to represent the active partition – of all reachable Net LSA for the RPL subnet, or, – of all reachable Router LSA with the stub link for the RPL subnet When there is no Net LSA for the subnet Routers on the RPL subnet check if they are neighbors on the subnet with the picked router – If yes, they are on the active partition

Detection & Election via Host Route Of all the neighbors on the RPL subnet, the one with the lowest interface address advertises a host route for ITSELF – The one with second lowest address, or even everyone may also do so Ensures smooth transition when the current lowest host route is withdrawn Routers on the RPL subnet pick the lowest from all host routes within the subnet – The router who advertised that lowest host route represents the active partition

Entire RPL unreachable? RPA R1 R6 R5 R4 R2 R3 R7 R8 src1 rcv1 rcv3 src2 RPL RPA Rcv3 can’t even receive from src2 because nobody has route to RPA data join

Anycast RPL Put several Anycast RPA and links in different parts of the network – As if a regular RPL partitioned – When the entire network partitions, each partition can still operate independently as long as that partition has a reachable RPL – Before the partition, only one active RPL will be chosen, using the same procedures previously described As long as there are no hosts (vs. routers) on those links there should be no routing problem – The prefix is not really used for forwarding traffic because there are always host routes via which the routers and RPA are reached

IGP vs. Host Route method Additional routes with Host Route method – Works with any protocol, including RIP/BGP No additional signaling with IGP method – Works only with Link State Routing – Additional signaling required for inter-area Applicable only in case of intentional partitioning across areas - Anycast RPL Better control on election result – e.g. preferring the partition in backbone area

Summary No signaling changes Local PIM/routing interaction on RPL routers – PIM: treat a link as RPL only if all the following are met The RPF route to RPA is a direct route (existing criteria) The DR that this router is adjacent to has the highest address among all reachable Net LSAs for the link (additional criteria) – Routing: advertise host route for RPA per PIM’s instruction if and only if the link is treated as RPL Still need standardization for consistent behavior on all RPL routers In completely partitioned network, both partitions of the RPL are active and traffic flows completely within each partition are not affected

Plan Seek review & feedback Polish the solution – IGP extension to support Anycast RPL across areas – Better control on partition election? E.g. Avoid electing a disadvantaged partition Request WG review & adoption – After the polishing