Avoiding Unnecessary Upstream Traffic in Bidir-PIM Jeffrey Zhang Weesan Lee Juniper Networks 82th IETF, Taipei.

Slides:



Advertisements
Similar presentations
Introduction 1 Lecture 22 Network Layer (Broadcast and Multicast) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Advertisements

IP Multicast Lecture 2: PIM-SM Carl Harris Communications Network Services Virginia Tech.
Multicast Routing: Problem Statement r Goal: find a tree (or trees) connecting routers having local mcast group members m tree: not all paths between routers.
1 Internet Networking Spring 2004 Tutorial 7 Multicast Routing Protocols.
1 Internet Networking Spring 2006 Tutorial 7 DVMRP.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public BSCI Module 7 Lesson 3 1 IP Multicasting: Multicast Routing Protocols.
Jan 01, 2008CS573: Network Protocols and Standards D – Selective Multicast Network Protocols and Standards Winter
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Internet Networking Spring 2002
1 CSE 401N:Computer Network LECTURE-14 MULTICAST ROUTING.
© 2009 Cisco Systems, Inc. All rights reserved. Cisco Public Presentation_ID 1 BGP AS AN MVPN PE-CE Protocol draft-keyupate-l3vpn-mvpn-pe-ce-00 Keyur Patel,
Computer Networks 2 Lecture 1 Multicast.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
Network Layer4-1 R1 R2 R3R4 source duplication R1 R2 R3R4 in-network duplication duplicate creation/transmission duplicate Broadcast Routing r Deliver.
Multicast Outline Multicast revisited Protocol Independent Multicast - SM Future Directions.
1 CMPT 471 Networking II IGMP (IPv4) and MLD (IPv6) © Janice Regan,
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
IP Multicast Lecture 3: PIM-SM Carl Harris Communications Network Services Virginia Tech.
Kurt Windisch -- University of OregonIETF GATED -- December 7, PIM Dense Mode GateD Implementation Kurt Windisch Dave Meyer Advanced Network Technology.
IP Multicast Part I: Fundamentals Carl Harris Communications Network Services Virginia Tech.
Computer Science 6390 – Advanced Computer Networks Dr. Jorge A. Cobb Deering, Estrin, Farinacci, Jacobson, Liu, Wei SIGCOMM 94 An Architecture for Wide-Area.
Multicast Routing Protocols. The Need for Multicast Routing n Routing based on member information –Whenever a multicast router receives a multicast packet.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
IP Multicast COSC Addressing Class D address Ethernet broadcast address (all 1’s) IP multicast using –Link-layer (Ethernet) broadcast –Link-layer.
CS 4396 Computer Networks Lab IP Multicast - Fundamentals.
Broadcast and multicast routing. R1 R2 R3R4 source duplication R1 R2 R3R4 in-network duplication duplicate creation/transmission duplicate Broadcast Routing.
PIM MTID point on draft-ietf-pim-mtid-01 PIM Working Group IETF 75 meeting Stockholm (Sweden) July 2009.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #7 DVMRP.
IETF78 Multimob Masstricht1 Proposal for Tuning IGMPv3/MLDv2 Protocol Behavior in Wireless and Mobile networks draft-wu-multimob-igmp-mld-tuning-02 Qin.
Problem Descriptions Chairs 1. Problems One slide per problem proposed First the proposer talks about it Next WG comments are solicited Chairs only to.
1 Multicast Routing Blackhole Avoidance draft-asati-pim-multicast-routing-blackhole-avoid-00 Rajiv Asati Mike McBride IETF 72, Dublin.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
1 Protocol Independent Multicast (PIM) To develop a scalable protocol independent of any particular unicast protocol –ANY unicast protocol to provide routing.
PIM-BIDIR RP Resiliency Jeffrey Zhang, Kurt Windisch, Jaroslaw Adam Gralak Juniper Networks 88 th IETF, Vancouver.
1 Group Communications: MOSPF and PIM Dr. Rocky K. C. Chang 19 March, 2002.
Unnecessary Multicast Flooding Problem Statement
Draft-ietf-pim-port-03 wglc. WGLC responses Thomas suggested a long list of changes, mostly editorial –I believe I addressed all Dimitri also had comments.
Internet Multicasting Routing: DVMRP r DVMRP: distance vector multicast routing protocol, RFC1075 r flood and prune: reverse path forwarding, source-based.
IP Multicast Lecture 4: PIM-SM Carl Harris Communications Network Services Virginia Tech.
DVMRP Distance Vector Multicast Routing Protocol Jerad Bates UMBC - Fall 2006.
1 Group Communications: Reverse Path Multicast Dr. Rocky K. C. Chang 19 March, 2002.
Engineering Workshops 96 ASM. Engineering Workshops 97 ASM Allows SPTs and RPTs RP: –Matches senders with receivers –Provides network source discovery.
85th IETF – Atlanta, USA J. Asghar IJ. Wijnands S.Krishnaswawy V. Arya draft-asghar-pim-explicit-rpf-vector-00
Application Layer 2-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A.
MVPN/EVPN C-Multicast/SMET Route Enhancements Zhaohui Zhang, Robert Kebler Wen Lin, Eric Rosen Juniper Networks 96 th IETF, Berlin.
Global Table Multicast with BGP-MVPN Protocol
DMET 602: Networks and Media Lab
Multicasting protocols
MZR: A Multicast Protocol based on Zone Routing
MVPN Update Continued work on both architecture draft and BGP-MVPN draft Seeing “light at end of tunnel” ☺ Progress since last time: Carrier’s carrier.
(draft-archana-pimwg-pim-ping-00.txt)
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 Protocol Design Project 2016
PIM Proxy in EVPN Networks draft-skr-bess-evpn-pim-proxy-00
Multicast Outline Multicast revisited
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
MVPN/EVPN Tunnel Aggregation with Common Labels Zhaohui Zhang (Juniper) Eric Rosen (Juniper) Wen Lin (Juniper) Zhenbin Li (Huawei) BESS WG 20-March-2018.
draft-pim-with-ipv4-prefix-over-ipv6-nh
draft-ietf-pim-ecmp-01 IETF 82, Taipei
A Routing Protocol for WLAN Mesh
IP Multicast COSC /5/2019.
EVPN Inter-subnet Multicast Forwarding
Implementing Multicast
Optional Read Slides: Network Multicast
Inter-AS MVPN: Multihoming Considerations
draft-liu-pim-mofrr-tilfa-00
BGP Signaled Multicast
MVPN/MSDP SA Interoperation
Presenter: Raunak Banthia
Presentation transcript:

Avoiding Unnecessary Upstream Traffic in Bidir-PIM Jeffrey Zhang Weesan Lee Juniper Networks 82th IETF, Taipei

Scenario #1 of unnecessary upstream traffic The tree depicts all routers and their RPF interfaces (towards RP) –Assuming RPA is on a loopack interface More general situation described later No receiver anywhere – traffic should be stopped at the FHR R3/R7 RP R1 R2 R3R4 R5 R6R7R8 src1 src2 traffic traffic to be avoided

Scenario #2 of unnecessary upstream traffic RP R1 R2 R3R4 R5 R6R7R8 rcvr1 rcvr2 src3 src1 src4 src2 (*,g) traffic traffic to be avoided

RP-Prune procedures for scenario #1 RP has (*, G-prefix) notification route –vs. the normal “forwarding to RPL” route –Traffic hitting the route triggers throttled control plane notification Indicating traffic is being received unnecessarily –Otherwise it would have hit specific (*,G) forwarding route –The notification triggers RP-Prune out of the incoming IF Multicast to ALL-PIM-ROUTERS –Interface-wide RP-Prune Upon receiving the RP-Prune, downstream router installs (*, G) notification route –Subsequent traffic hits the (*, G) notification route, triggering RP- Prune further downstream, instead of being forwarded upstream RP-Prune is data-triggered hop-by-hop: –by the pre-installed (*,G-prefix) notification route on RP –by the triggered (*,G) notification route on downstream routers

RP-Prune scenario #1 illustration RP R1 R2 R3R4 R5 R6R7R8 src1 src2 RP-Prune

RP-Prune procedures for scenario #2 RP sends periodic neighbor-specific RP-Prune to the only downstream neighbor in (*,G) join state –Assumes Explicit Tracking If ET is not used, another downstream with the (*,G) state needs to trigger overriding (*,G) join upon receiving the RP-Prune, and the target of RP-Prune needs to ignore the RP-Prune when receiving that overriding (*,G) join Downstream router prunes the RPF IF from (*,G) forwarding route’s OIF list –Stops traffic from going upstream Downstream router further propagates RP-Prune to its only downstream neighbor –Terminates when there are more than one downstream IF/neighbor – R4 in the example

RP-Prune scenario #2 illustration RP R1 R2 R3R4 R5 R6R7R8 rcvr1 rcvr2 src1 src3 src2 src4 (*,g) RP-Prune

RP-Prune states Upstream IF & Neighbor List of downstream IF where RP-Prune was sent –Flag for interface-wide or nbr-specific RP-Prune –List of downstream neighbor on the IF A nbr-specific prune was sent to it, or A RP-Prune-Keep was received from it –A timer to time out if downstream stops refreshing RP-Prune- Keep –Interface-wide RP-Prune case (scenario #1)

RP-Prune state maintenane: Interface-wide RP-Prunes (Scenario #1) Maintained from downstream upwards –FHR keeps receiving data traffic, keeps the RP-Prune state alive for the incoming interface, and refreshes RP-Prune-Keep towards its upstream Each hop will refresh its upstream by RP-Prune-Keep –After source stops sending, FHR times out its RP- Prune state, and sends RP-Prune-Cancel upstream Each hop propagates the RP-Prune-Cancel if it no longer has other downstream in the RP-Prune state (i.e., no other sending branches)

RP-Prune state maintenance: Neighbor-specific RP-Prunes (Scenario #2) Maintained from RP downwards –RP refreshes RP-Prune as long as it has only one downstream neighbor –Each hop propagates the RP-Prune unless it has more than one downstream IF/Nbr

RP-Graft Procedures RP sends interface-wide RP-Graft to wherever it sent interface-wide RP-Prune before, when it gets initial corresponding (*,G) join state –also sends neighbor-specific RP-Prune to the new/only downstream neighbor (scenario #1 becomes #2) Any router (RP or not) who sent Neighbor-specific RP- Prune before triggers RP-Graft when it first gets more than one downstream IF/nbr for a (*, G) join state –Neighbor-specific RP-Graft sent to the downstream neighbor recorded in the RP-Prune state Upon receiving RP-Graft, downstream routers: –Removes (*,G) notification route (scenario #1), or –Adds RPF IF to (*,G) forwarding route (scenario #2) –Reply with RP-Prune-Cancel as acks Upstream retransmits RP-Graft until all applicable downstream neighbors in the RP-Prune state have ack’ed

What if RPA is not on a loopback IF? Normal Bidir-PIM behavior: –Traffic always forwarded to the RPL –Join/Prunes not sent to the RPL Modified behavior: –Join/Prunes sent to ALL-PIM-ROUTERs on RPL But not further downstream –Traffic forwarded to the RPL only if a corresponding join has been received on the RPL –Each router on the RPL is called a virtual RP and follows the RP- Prune/Graft procedures defined earlier Another virtual RP considered as a downstream for a particular group if a join has been received from it RP-Graft/Prune/Prune-Keep/Prune-Cancel messages are not sent to the RPL though

Virtual RP illustration R1 R5 R6 R3R4 R2 RPA (*,g) rcvr Virtual RP R1~R3 all have only one downstream (R4 on the RPL), but do not send RP-Prune (to R4 on the RPL) Virtual RP R4 has one downstream R6 and sends RP-Prune to it If R5 gets a receiver, R4 will send RP-Graft to R6 because it now has two dowstream: R6 and R3 RPL

Handling of topology changes When RPF IF/nbr changes –Sends RP-Graft downstream –Remove RP-Prune states Remove (*,G) notification routes, or Add back, or add new RPF IF to (*,G) forwarding route

Scaling properties Scenario #1 –Data-driven (*,G) RP-Prune states on relevant sending branch only For traffic that nobody wants –traffic with receivers does go through w/o data-driven events Time out when source stops sending Scenario #2 –Control-driven (*,G) RP-Prune states on relevant single-downstream routers only Minimum states for stopping unnecessary upstream traffic

Next steps Fill in some missing details in draft -00 Seek comments and WG adoption