Study guide
13.2 Protocol Independent Multicast (PIM-SM, PIM-SSM & Bidir-PIM)
CCNP Enterprise ENCOR 350-401
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Enterprise Architecture & Hierarchical Design
1.1 Enterprise Network Design Models & Hierarchical Campus Architecture 1.2 On-Premises, Cloud & Hybrid Infrastructure Deployment Models 1.3 Hardware Switching Architecture & Packet Forwarding
2 Chapter 2: Enterprise Quality of Service (QoS)
2.1 QoS Components: Classification, Marking & Trust Boundaries 2.2 QoS Policy: Queuing, Shaping, Policing & Interpreting MQC Output
3 Chapter 3: Software-Defined WAN (Catalyst SD-WAN)
3.1 Cisco Catalyst SD-WAN Architecture & Orchestration 3.2 SD-WAN Policies, Traffic Engineering & Application-Aware Routing
4 Chapter 4: Software-Defined Access (Catalyst SD-Access)
4.1 Catalyst SD-Access Fabric Architecture & Plane Separation 4.2 Cisco TrustSec, Security Group Tags (SGT), SXP & MACsec
5 Chapter 5: Device & Data Path Virtualization
5.1 Server & Network Device Virtualization 5.2 VRF-Lite & Virtual Routing Multi-Tenancy 5.3 GRE & IPsec Tunnel Virtualization Mechanics
6 Chapter 6: Network Virtualization & Overlay Technologies
6.1 LISP Architecture & EID-to-RLOC Mapping Mechanics 6.2 VXLAN & EVPN Overlay Architecture
7 Chapter 7: Layer 2 Infrastructure & Switching
7.1 VLANs, 802.1Q Trunking & VTPv3 7.2 Spanning Tree Protocol Mechanics 7.3 Advanced STP Protection Mechanisms 7.4 EtherChannel Link Aggregation
8 Chapter 8: Layer 3 Routing Foundations & EIGRP
8.1 IP Routing Foundations & Administrative Distance 8.2 Enhanced Interior Gateway Routing Protocol (EIGRP)
9 Chapter 9: OSPFv2 & OSPFv3 Operations
9.1 OSPFv2 Architecture & Neighbor State Machine 9.2 OSPF LSA Types & Multi-Area Design 9.3 OSPFv3 for IPv4 and IPv6 Address Families
10 Chapter 10: Border Gateway Protocol (BGP)
10.1 BGP Architecture, Neighbor States & Peering 10.2 BGP Path Attributes & Best Path Selection Algorithm
11 Chapter 11: Policy-Based Routing & Route Redistribution
11.1 Policy-Based Routing (PBR) & Route Maps 11.2 Route Redistribution & Loop Prevention
12 Chapter 12: IP Services & High Availability
12.1 First Hop Redundancy Protocols (HSRP, VRRP & GLBP) 12.2 Network Time Protocol (NTPv4) & Precision Time Protocol (PTP) 12.3 Network Address Translation (NAT/PAT) & VRF-Aware NAT
13 Chapter 13: IP Multicast Operations
13.1 IP Multicast Addressing, Group Management (IGMPv1/v2/v3) & IGMP Snooping 13.2 Protocol Independent Multicast (PIM-SM, PIM-SSM & Bidir-PIM) 13.3 Rendezvous Point (RP) Distribution Mechanisms
14 Chapter 14: Network Assurance & Monitoring
14.1 Diagnostic Utilities, Conditional Debugging & Path MTU Discovery 14.2 Syslog Architecture, Logging Facilities & Severity Levels 14.3 SNMPv1/v2c/v3 Security & Flexible NetFlow (FNF) Architecture 14.4 Switched Port Analyzer (SPAN, RSPAN, ERSPAN) & IP SLA Object Tracking
15 Chapter 15: Catalyst Center Assurance & Controller Operations
15.1 Cisco Catalyst Center (DNA Center) Assurance & AI Network Analytics 15.2 Cisco Catalyst Center Device Onboarding & Software Image Management (SWIM)
16 Chapter 16: Enterprise Security & Access Control
16.1 Device Hardening, AAA Architecture & RADIUS/TACACS+ 16.2 Access Control Lists (ACLs) for Infrastructure Security 16.3 Control Plane Policing (CoPP) & Control Plane Protection (CPPr) 16.4 Layer 2 Infrastructure Security Features 16.5 IEEE 802.1X Port-Based Authentication & MAB
17 Chapter 17: Threat Defense & API Security
17.1 Enterprise VPN Technologies (DMVPN Phase 1/2/3 & FlexVPN) 17.2 Next-Generation Threat Defense & Secure Access Service Edge (SASE)
18 Chapter 18: Network Automation, Programmability & Data Modeling
18.1 Python Fundamentals for Network Engineers & Cisco Libraries 18.2 YANG Data Modeling Language (RFC 6020/7950) & Model Types 18.3 REST API Architecture, HTTP Verbs, Security & Cisco Controller APIs 18.4 Model-Driven Telemetry (MDT) & NETCONF/RESTCONF Operations
19 Chapter 19: Orchestration, EEM & AI Operations
19.1 Configuration Management & Infrastructure as Code (Ansible & Terraform) 19.2 Cisco Embedded Event Manager (EEM) & Intent-Based Networking
13.2 Protocol Independent Multicast (PIM-SM, PIM-SSM & Bidir-PIM)
Key Takeaways Explain This Topic AI
Multicast distribution trees are categorized into Source Trees / Shortest Path Trees (SPT, notation (S, G) ) rooted directly at the source, and Shared Trees / Root Path Trees (RPT, notation (*, G) ) rooted at a centralized Rendezvous Point (RP).
The Reverse Path Forwarding (RPF) check prevents multicast routing loops by ensuring multicast packets arrive strictly on the interface that the unicast routing table would use to route back toward the source (S) or the RP (*) .
PIM-SM (RFC 7761) operates over IP protocol 103 using an explicit join model with Hello, Join/Prune, Register, and Register-Stop messages, elects Designated Routers (DRs) by highest priority (default 1) then highest IP, and switches to the Shortest Path Tree at the Last-Hop Router on the very first data packet received over the Shared Tree -- the LHR then sends an (S, G) Join toward the source and a prune toward the RP.
Source-Specific Multicast (PIM-SSM, 232.0.0.0/8) eliminates Shared Trees, Rendezvous Points, and Register encapsulation by having IGMPv3 receivers build direct (S, G) Shortest Path Trees immediately.
Bidirectional PIM (RFC 5015) builds only bidirectional shared trees, never registers sources and never switches to an SPT, so it holds O(G) state instead of O(S x G) and is the correct choice for many-to-many applications with thousands of sources.
Last updated: August 2026
13.2 Protocol Independent Multicast (PIM-SM & PIM-SSM)
Core Blueprint Focus: Cisco 350-401 ENCOR v1.2 topic 3.3.d requires candidates to configure and verify Protocol Independent Multicast (PIM), including PIM Sparse Mode (PIM-SM) operations, Source Tree (SPT) vs. Shared Tree (RPT) distribution models, Reverse Path Forwarding (RPF) check mechanics, Designated Router (DR) election, SPT switchover, and Source-Specific Multicast (PIM-SSM).
While IGMP manages multicast membership between receiver hosts and local routers, Protocol Independent Multicast (PIM) operates between routers to build loop-free multicast distribution trees across the enterprise Layer 3 topology. PIM is "protocol independent" because it does not maintain its own routing topology; instead, it leverages the existing Unicast Routing Table (RIB) —populated by OSPF, EIGRP, BGP, or static routes—to perform loop prevention and tree construction.
1. Multicast Distribution Trees: Source Tree (SPT) vs. Shared Tree (RPT)
Multicast forwarding structures are modeled as tree graphs connecting sources to receivers without loops. +-----------------------------------------------------------------------------------+
- | SOURCE TREE (SPT) VS. SHARED TREE (RPT) |
- +-----------------------------------------------------------------------------------+
- | |
- | SOURCE TREE / SHORTEST PATH TREE (SPT) SHARED TREE / ROOT PATH TREE (RPT) |
- | Notation: (S, G) Notation: (*, G) |
- | |
- | [ Source S1 ] [ Rendezvous Point (RP) ] |
- | | / \ |
- | [ Router A ] [ Router B ] [ Router C ] |
- | / \ | | |
- | [ Router B ] [ Router C ] [ Router D ] [ Router E ] |
- | | | | | |
- | [ Receiver 1 ] [ Receiver 2 ] [ Receiver 1 ] [ Receiver 2 ] |
- | |
- | • Rooted directly at Source S1 • Rooted at Centralized RP |
- | • Optimal path & lowest latency • Suboptimal path (Triangle routing) |
- | • High router memory (per-source state) • Low router memory (1 state per group)|
- +-----------------------------------------------------------------------------------+
- Architectural Comparison
- Technical Dimension Source Tree / Shortest Path Tree (SPT) Shared Tree / Root Path Tree (RPT)
- mroute Notation (S, G) (Specific Source S S S , Group G G G ) (*, G) (Wildcard Any Source, Group G G G )
- Tree Root The physical Multicast Source ( S S S ) The centralized Rendezvous Point (RP)
Forwarding Path Optimal, lowest-latency path from source to receivers Suboptimal "dog-leg" path traversing the RP
State Memory Scale Requires O ( S × G ) O(S \times G) O ( S × G ) state entries across all routers Requires O ( G ) O(G) O ( G ) state entries regardless of source count
PIM Protocols Used PIM Dense Mode, PIM-SM (after SPT switchover), PIM-SSM PIM Sparse Mode (initial join phase), Bidirectional PIM
2. Reverse Path Forwarding (RPF) Check Mechanics
In standard unicast routing, a router forwards a packet toward its destination based on destination IP address lookup. In multicast routing, the destination address is an abstract group, and the source transmits to unknown destinations.
To prevent catastrophic multicast loops and packet replication storms, multicast routers rely on Reverse Path Forwarding (RPF) . Instead of asking "Where is this packet going?" , the router asks: "Did this packet arrive on the interface I would use to reach the sender?" \text{"Did this packet arrive on the interface I would use to reach the sender?"} "Did this packet arrive on the interface I would use to reach the sender?" +-----------------------------------------------------------------------------------+
- | REVERSE PATH FORWARDING (RPF) LOGIC |
- +-----------------------------------------------------------------------------------+
- | |
- | [ Source: 10.1.1.50 ] |
- | | |
- | v |
- | [ Upstream Router ] |
- | / \ |
- | Gi0/0/1 / \ Gi0/0/2 |
- | v v |
- | +----------------------------+ |
- | | Receiving Router | |
- | | | |
- | | Unicast Routing Table (RIB)| |
- | | 10.1.1.0/24 via Gi0/0/1 | |
- | +----------------------------+ |
- | / \ |
- | Packet arrives on Gi0/0/1: Packet arrives on Gi0/0/2: |
- | [ RPF CHECK PASSES ] [ RPF CHECK FAILS ] |
- | -> Forward out OIL -> SILENTLY DROP PACKET |
- +-----------------------------------------------------------------------------------+
- The RPF Calculation Algorithm
When a multicast packet arrives on an ingress interface, the router extracts the Source IP ( S S S ) from the packet header (for SPT forwarding) or the RP IP (for Shared Tree forwarding).
The router queries its Unicast Routing Table (or dedicated Multicast RIB) for the longest prefix match to that IP.
The outgoing interface in the unicast routing table is designated as the RPF Interface for that source/RP.
The next-hop router in the unicast routing table is designated as the RPF Neighbor .
Evaluation:
If the packet arrived on the RPF Interface: RPF Check Passes . The router replicates and forwards the packet out all interfaces in its Outgoing Interface List (OIL) .
If the packet arrived on any non-RPF interface: RPF Check Fails . The router silently drops the packet .
3. PIM Sparse Mode (PIM-SM) Control Plane & Message Types
PIM Sparse Mode (RFC 7761) utilizes an explicit join model : multicast traffic is never sent to a subnet unless a downstream receiver has explicitly requested it via an IGMP report.
PIM runs directly on top of IP using IP Protocol 103 , sending link-local messages to 224.0.0.13 (All-PIM-Routers) with TTL=1. +-----------------------------------------------------------------------------------+
- | CORE PIM-SM MESSAGE TYPES |
- +-----------------------------------------------------------------------------------+
- | Type | Message Name | Transport / Destination | Purpose |
- | ---- | ------------------ | ----------------------- | --------------------------- |
- | 0 | **Hello** | Multicast `224.0.0.13` | Neighbor discovery, DR |
- | | | (Hop-by-hop, 30s timer) | election, GenID tracking |
- | 1 | **Register** | Unicast to RP IP | FHR encapsulates source data|
- | 2 | **Register-Stop** | Unicast to FHR IP | RP halts FHR encapsulation |
- | 3 | **Join / Prune** | Multicast `224.0.0.13` | Builds/tears down tree state|
- | 4 | **Bootstrap (BSM)**| Multicast `224.0.0.13` | Dynamic RP distribution |
- | 5 | **Assert** | Multicast `224.0.0.13` | Eliminates duplicate streams|
- | 8 | **Candidate-RP-Adv**| Unicast to BSR IP | C-RP announces to BSR |
- +-----------------------------------------------------------------------------------+
- PIM Designated Router (DR) Election
On multi-access broadcast LANs (e.g., shared Ethernet subnets with multiple routers), electing a single Designated Router (DR) prevents duplicate control messages and duplicate traffic streams.
DR Responsibilities:
On Receiver Subnets: The DR acts on IGMP Membership Reports and sends PIM (*, G) or (S, G) Joins upstream toward the RP/Source.
On Source Subnets: The DR receives multicast packets from local sources, encapsulates them into PIM Register unicast messages, and transmits them to the RP.
Election Criteria:
Highest DR Priority ( ip pim dr-priority <value> , default = 1, range 0 to 4294967295).
Tie-Breaker: Highest IPv4 address on the interface.
PIM Assert Mechanism
If two routers on a multi-access LAN both forward the same multicast stream down to hosts, receivers receive duplicate packets. The routers detect this collision and immediately exchange PIM Assert messages:
Routers compare their Unicast Administrative Distance (AD) to the source.
If AD is tied, routers compare their Unicast Metric to the source.
If metric is tied, the router with the Highest IP Address wins.
The winner continues forwarding; the loser removes the interface from its OIL and stops transmitting.
4. End-to-End PIM-SM Lifecycle & SPT Switchover
The complete operational lifecycle of PIM-SM involves three sequential phases: Shared Tree Join , Source Registration , and Shortest Path Tree (SPT) Switchover . +-----------------------------------------------------------------------------------+
- | PIM-SM FULL OPERATIONAL LIFECYCLE |
- +-----------------------------------------------------------------------------------+
- | |
- | [Source S] ---> (1. Multicast) ---> [ FHR / DR ] === 2. PIM Register (Unicast)==> [ RP ]
- | | |
- | | |
- | 4. Direct SPT (S,G) 3. Shared Tree
- | | (*, G)
- | v v
- | [Receiver] <--- (IGMP Report) <--- [ LHR / DR ] <=== 5. PIM Prune (*, G) <=== [ Router ]
- +-----------------------------------------------------------------------------------+
- Step-by-Step Execution
Phase 1: Receiver Joins Shared Tree (*, G) :
A host sends an IGMP Membership Report for group G G G to Last-Hop Router (LHR).
LHR creates a (*, G) mroute entry and sends a PIM (*, G) Join hop-by-hop toward the Rendezvous Point (RP).
Intermediate routers add the downstream interface to their (*, G) Outgoing Interface List (OIL).
Phase 2: Source Registers with the RP:
Source S S S begins transmitting multicast packets to group G G G .
First-Hop Router (FHR) intercepts the packets. Because FHR does not yet have an SPT to the receivers, it encapsulates the entire multicast packet inside a unicast PIM Register packet and unicasts it directly to the RP.
RP decapsulates the packet and forwards native multicast data down the Shared Tree (*, G) to the LHR and receivers.
Simultaneously, RP sends a native (S, G) Join back toward the FHR to build a native SPT between FHR and RP.
Once native (S, G) data arrives at the RP, the RP unicasts a PIM Register-Stop message to FHR, instructing FHR to cease software encapsulation.
Phase 3: Shortest Path Tree (SPT) Switchover:
As soon as the LHR receives the very first data packet from Source S S S forwarded over the Shared Tree, the LHR learns the source's unicast IP address.
In Cisco IOS-XE, the default SPT threshold is 0 kbps ( ip pim spt-threshold 0 ).
LHR performs an RPF lookup for Source S S S and sends a PIM (S, G) Join directly toward Source S S S .
As soon as multicast traffic arrives at LHR via the optimal (S, G) path, LHR sends a PIM (S, G) Prune (with the RP-bit set) upstream toward the RP on the Shared Tree to eliminate duplicate packet delivery.
Loading diagram... PIM-SM Source Registration and SPT Switchover Sequence
5. Source-Specific Multicast (PIM-SSM)
Source-Specific Multicast (PIM-SSM) , standardized in RFC 4607, is a streamlined evolution of PIM that eliminates Shared Trees, Rendezvous Points (RPs), Register encapsulation, and MSDP entirely.
Dedicated Address Range: 232.0.0.0/8 ( 232.0.0.0 to 232.255.255.255 ).
Operation:
The receiver application learns the Source IP ( S S S ) and Group IP ( G G G ) out-of-band (e.g., via web portal, DNS, or SDP file).
The receiver uses IGMPv3 to signal an explicit INCLUDE (S, G) join to the Last-Hop Router.
LHR immediately sends a PIM (S, G) Join directly upstream toward Source S S S .
The Shortest Path Tree is built immediately—no Shared Tree, no RP lookup, no Register messages. +-----------------------------------------------------------------------------------+
- | PIM-SM VS. PIM-SSM ARCHITECTURE |
- +-----------------------------------------------------------------------------------+
- | Feature | PIM Sparse Mode (PIM-SM) | PIM Source-Specific (SSM)|
- | -------------------------- | -------------------------- | ------------------------ |
- | Address Range | 224.0.0.0/4 (Any Group) | 232.0.0.0/8 (Dedicated) |
- | Signaling Protocol | IGMPv2 or IGMPv3 | **IGMPv3 Strictly** |
- | Rendezvous Point (RP) | **Required** | **None (No RP Needed)** |
- | Distribution Trees Built | Shared (*, G) then (S, G) | **Direct (S, G) SPT Only**|
- | Denial of Service Risk | High (Rogue sources to RP) | Zero (Receiver selects S)|
- +-----------------------------------------------------------------------------------+
- 6. Cisco IOS-XE Configuration & Verification CLI
- 1. Configuring PIM-SM and PIM-SSM ! Globally enable multicast routing
- ip multicast-routing
- ! Enable PIM-SSM with default 232.0.0.0/8 range
- ip pim ssm default
- ! Enable PIM Sparse Mode and tune DR priority on interfaces
- interface GigabitEthernet0/0/1
- description DOWNLINK-TO-RECEIVERS
- ip address 10.10.10.1 255.255.255.0
- ip pim sparse-mode
- ip pim dr-priority 100
- ip igmp version 3
!
- interface GigabitEthernet0/0/2
- description CORE-UPLINK
- ip address 10.20.20.1 255.255.255.0
- ip pim sparse-mode
- 2. Tuning SPT Switchover Threshold ! Default behavior: Switchover immediately on 1st packet (0 kbps)
- ip pim spt-threshold 0
- ! Force router to remain on Shared Tree (*, G) permanently (never switch to SPT)
- ip pim spt-threshold infinity
- 3. Verification Commands & Diagnostics Router# show ip pim neighbor
- PIM Neighbor Table
- Mode: B - Bidir Capable, SS - SSM Capable
- Neighbor Interface Uptime/Expires Ver DR
- Address Prio/Mode
- 10.20.20.2 GigabitEthernet0/0/2 02:14:05/00:01:25 v2 1 / S
- 10.10.10.2 GigabitEthernet0/0/1 00:45:12/00:01:32 v2 100 / DR S SS
- Router# show ip rpf 172.16.1.100
- RPF information for ? (172.16.1.100)
- RPF interface: GigabitEthernet0/0/2
- RPF neighbor: ? (10.20.20.2)
- RPF route/mask: 172.16.1.0/24
- RPF type: unicast (ospf 1)
- Doing distance-preferred lookups across tables
- RPF topology: ipv4 multicast base, originated from ipv4 unicast base
- Router# show ip mroute 239.1.1.1
- IP Multicast Routing Table
- Flags: D - Dense, S - Sparse, B - Bidir Group, s - SSM Group, C - Connected,
- L - Local, P - Pruned, R - RP-bit set, F - Register flag, T - SPT-bit set,
- J - Join SPT, M - MSDP created entry, E - Extranet
- (*, 239.1.1.1), 00:04:15/00:02:44, RP 10.255.255.1, flags: SJC
- Incoming interface: GigabitEthernet0/0/2, RPF nbr 10.20.20.2
Outgoing interface list:
GigabitEthernet0/0/1, Forward/Sparse, 00:04:15/00:02:44
- (172.16.1.100, 239.1.1.1), 00:00:18/00:03:11, flags: T
- Incoming interface: GigabitEthernet0/0/2, RPF nbr 10.20.20.2
Outgoing interface list:
GigabitEthernet0/0/1, Forward/Sparse, 00:00:18/00:03:11
7. Bidirectional PIM (Bidir-PIM, RFC 5015)
ENCOR v1.2 expanded topic 3.3.d to name multicast protocols "such as RPF check, PIM SM , IGMP v2/v3, SSM , bidir , and MSDP ." Bidirectional PIM was not called out by name in v1.1, so it is one of the genuinely new items on the v1.2 blueprint.
7.1 The Problem Bidir-PIM Solves
PIM-SM and PIM-SSM both end up building source trees , which means every router on the path holds an (S, G) entry for every active source. For one-to-many distribution — a video stream, a market data feed — that is fine, because S is small.
Now consider a many-to-many application: a trading floor where 800 workstations are simultaneously senders and receivers of the same group, or a large conferencing deployment. State scales as O(S x G) , so 800 sources in one group means 800 (S, G) entries on every router in the path. Multiply that across groups and the multicast routing table becomes the constraint.
Bidir-PIM removes source state entirely. It builds one bidirectional shared tree per group and holds only (*, G) state, so consumption is O(G) regardless of how many sources exist . Adding the 801st sender adds zero new state anywhere.
7.2 What Bidir-PIM Removes
- Mechanism PIM-SM PIM-SSM Bidir-PIM
- Rendezvous Point required Yes No Yes
- Source Registration (PIM Register/Register-Stop) Yes No No — never
- SPT switchover Yes (default at first packet) N/A (starts on SPT) No — never
- State held (*, G) then (S, G) (S, G) only (*, G) only
- State scale O(S x G) O(S x G) O(G)
- Loop prevention RPF check RPF check Designated Forwarder election
- Receiver signalling IGMPv2/v3 IGMPv3 required IGMPv2 sufficient
- Group range Any 232.0.0.0/8 Administratively assigned
Traffic flows in both directions on the same tree. A source simply forwards its traffic up the shared tree toward the RP on the same branches that carry traffic down toward receivers — hence "bidirectional". There is no encapsulated Register message, so the RP never touches the data plane.
7.3 Designated Forwarder Election
Because traffic travels upstream on the shared tree, the ordinary RPF check cannot be used for loop prevention — an incoming packet may legitimately arrive on the interface pointing toward the RP. Bidir-PIM replaces it with the Designated Forwarder (DF) .
On every link , for every RP , the routers elect exactly one DF:
The router advertising the best unicast routing metric to the RP address wins (lowest administrative distance first, then lowest metric).
Ties are broken by the highest IP address on the link.
Only the DF may forward traffic onto that link toward the RP, and only the DF may forward traffic off the tree onto that link. Because exactly one router per link performs both jobs, a packet can never be duplicated or looped, which is precisely the guarantee the RPF check provides in PIM-SM.
The DF is elected per link and per RP, not per group. A router can be DF on one interface and a non-DF on another simultaneously.
7.4 The Phantom RP
The RP in Bidir-PIM performs no data-plane work at all — it never decapsulates a Register, never joins a source tree, and never forwards on behalf of a source. Its address exists only as the root of the shared tree and the target of the DF metric comparison .
That allows the phantom RP design: the RP address is a routable address that no device actually owns . Two candidate routers advertise it as a loopback with different prefix lengths (for example a /30 on the primary and a /29 on the secondary covering the same address). Longest-prefix match steers every router to the primary, and if the primary fails the /29 takes over automatically — RP redundancy with no protocol, no MSDP, and no state synchronisation. Contrast this with Anycast RP in PIM-SM (Section 13.3), which needs MSDP or PIM Anycast RP precisely because the RP there does learn source state.
7.5 Configuration and Verification ! Bidir must be explicitly enabled globally before any bidir RP can be configured
- ip multicast-routing distributed
- ip pim bidir-enable
!
- ! Define which group range uses the bidirectional shared tree
- ip access-list standard BIDIR-GROUPS
- permit 239.200.0.0 0.0.255.255
!
ip pim rp-address 10.255.255.10 BIDIR-GROUPS bidir
!
- interface GigabitEthernet0/0/1
- ip pim sparse-mode
!
- ! ---- Verification ----
- Router# show ip pim rp mapping
- PIM Group-to-RP Mappings
- Group(s): 239.200.0.0/16, Static, Bidir Mode
- RP: 10.255.255.10 (?)
!
- Router# show ip pim interface df
- Interface RP DF Winner Metric State
- GigabitEthernet0/0/1 10.255.255.10 10.1.12.1 20 DF
- GigabitEthernet0/0/2 10.255.255.10 10.1.23.3 10 Non-DF
!
- Router# show ip mroute 239.200.1.1
- (*, 239.200.1.1), 00:12:41/00:02:52, RP 10.255.255.10, flags: BC
- Bidir-Upstream: GigabitEthernet0/0/1, RPF nbr 10.1.12.1
Incoming interface list:
GigabitEthernet0/0/1, Bidir-Upstream/Sparse
Outgoing interface list:
GigabitEthernet0/0/3, Forward/Sparse, 00:12:41/00:02:52
How to read that output: the B flag in show ip mroute marks a Bidir group and the Bidir-Upstream line names the interface toward the RP. The decisive confirmation that Bidir-PIM is working is that there are no (S, G) entries at all , no matter how many hosts are sending. If you see (S, G) entries for a group you configured as bidir, the bidir keyword is missing from the RP statement, ip pim bidir-enable was never applied, or a router in the path does not support Bidir-PIM and has silently fallen back to sparse mode.