HP 6125G HP 6125G & 6125G/XG Blade Switches IP Multicast Configuration - Page 113

Configuring PIM, PIM overview

Page 113 highlights

Configuring PIM PIM overview Protocol Independent Multicast (PIM) provides IP multicast forwarding by leveraging unicast static routes or unicast routing tables generated by any unicast routing protocol, such as routing information protocol (RIP), open shortest path first (OSPF), or border gateway protocol (BGP). Independent of the unicast routing protocols running on the device, multicast routing can be implemented as long as the corresponding multicast routing entries are created through unicast routes. PIM uses the reverse path forwarding (RPF) mechanism to implement multicast forwarding. When a multicast packet arrives on an interface of the device, it undergoes an RPF check. If the RPF check succeeds, the device creates the corresponding routing entry and forwards the packet. If the RPF check fails, the device discards the packet. For more information about RPF, see "Configuring multicast routing and forwarding." Based on the implementation mechanism, PIM falls into the following categories: • Protocol Independent Multicast-Dense Mode (PIM-DM) • Protocol Independent Multicast-Sparse Mode (PIM-SM) • Protocol Independent Multicast Source-Specific Multicast (PIM-SSM) The term "router" in this document refers to both routers and Layer 3 switches. PIM-DM overview PIM-DM is a type of dense mode multicast protocol. It uses the push mode for multicast forwarding, and is suitable for small-sized networks with densely distributed multicast members. The basic implementation of PIM-DM is as follows: • PIM-DM assumes that at least one multicast group member exists on each subnet of a network. Therefore, multicast data is flooded to all nodes on the network. Then, branches without multicast forwarding are pruned from the forwarding tree, leaving only those branches that contain receivers. This flood-and-prune process takes place periodically. Pruned branches resume multicast forwarding when the pruned state times out. Data is then flooded again down these branches, and then the branches are pruned again. • When a new receiver on a previously pruned branch joins a multicast group, to reduce the join latency, PIM-DM uses a graft mechanism to resume data forwarding to that branch. Generally speaking, the multicast forwarding path is a source tree. That is, it is a forwarding tree with the multicast source as its "root" and multicast group members as its "leaves." Because the source tree is the shortest path from the multicast source to the receivers, it is also called a shortest path tree (SPT). The working mechanism of PIM-DM is summarized as follows: • Neighbor discovery • SPT building • Graft • Assert 102

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82
  • 83
  • 84
  • 85
  • 86
  • 87
  • 88
  • 89
  • 90
  • 91
  • 92
  • 93
  • 94
  • 95
  • 96
  • 97
  • 98
  • 99
  • 100
  • 101
  • 102
  • 103
  • 104
  • 105
  • 106
  • 107
  • 108
  • 109
  • 110
  • 111
  • 112
  • 113
  • 114
  • 115
  • 116
  • 117
  • 118
  • 119
  • 120
  • 121
  • 122
  • 123
  • 124
  • 125
  • 126
  • 127
  • 128
  • 129
  • 130
  • 131
  • 132
  • 133
  • 134
  • 135
  • 136
  • 137
  • 138
  • 139
  • 140
  • 141
  • 142
  • 143
  • 144
  • 145
  • 146
  • 147
  • 148
  • 149
  • 150
  • 151
  • 152
  • 153
  • 154
  • 155
  • 156
  • 157
  • 158
  • 159
  • 160
  • 161
  • 162
  • 163
  • 164
  • 165
  • 166
  • 167
  • 168
  • 169
  • 170
  • 171
  • 172
  • 173
  • 174
  • 175
  • 176
  • 177
  • 178
  • 179
  • 180
  • 181
  • 182
  • 183
  • 184
  • 185
  • 186
  • 187
  • 188
  • 189
  • 190
  • 191
  • 192
  • 193
  • 194
  • 195
  • 196
  • 197
  • 198
  • 199
  • 200
  • 201
  • 202
  • 203
  • 204
  • 205
  • 206
  • 207
  • 208
  • 209
  • 210
  • 211
  • 212
  • 213
  • 214
  • 215
  • 216
  • 217
  • 218
  • 219
  • 220
  • 221
  • 222
  • 223
  • 224
  • 225
  • 226
  • 227
  • 228
  • 229
  • 230
  • 231
  • 232
  • 233
  • 234
  • 235
  • 236
  • 237
  • 238
  • 239
  • 240
  • 241
  • 242
  • 243
  • 244
  • 245
  • 246
  • 247
  • 248
  • 249
  • 250
  • 251
  • 252
  • 253
  • 254
  • 255
  • 256
  • 257
  • 258
  • 259
  • 260
  • 261
  • 262
  • 263
  • 264
  • 265
  • 266
  • 267
  • 268
  • 269
  • 270
  • 271
  • 272
  • 273
  • 274
  • 275
  • 276
  • 277
  • 278
  • 279
  • 280
  • 281
  • 282
  • 283
  • 284
  • 285
  • 286
  • 287
  • 288
  • 289
  • 290
  • 291
  • 292
  • 293
  • 294
  • 295
  • 296
  • 297
  • 298
  • 299
  • 300
  • 301
  • 302
  • 303
  • 304
  • 305
  • 306
  • 307
  • 308
  • 309
  • 310
  • 311
  • 312
  • 313
  • 314
  • 315
  • 316
  • 317
  • 318
  • 319
  • 320
  • 321
  • 322
  • 323
  • 324
  • 325
  • 326
  • 327
  • 328
  • 329
  • 330
  • 331
  • 332
  • 333
  • 334
  • 335
  • 336
  • 337
  • 338
  • 339
  • 340
  • 341
  • 342
  • 343
  • 344
  • 345
  • 346
  • 347
  • 348
  • 349
  • 350
  • 351
  • 352
  • 353
  • 354
  • 355
  • 356
  • 357
  • 358
  • 359
  • 360
  • 361
  • 362
  • 363
  • 364
  • 365
  • 366
  • 367
  • 368
  • 369
  • 370
  • 371
  • 372
  • 373
  • 374
  • 375
  • 376
  • 377
  • 378
  • 379

102
Configuring PIM
PIM overview
Protocol Independent Multicast (PIM) provides IP multicast forwarding by leveraging unicast static routes
or unicast routing tables generated by any unicast routing protocol, such as routing information protocol
(RIP), open shortest path first (OSPF), or border gateway protocol (BGP). Independent of the unicast
routing protocols running on the device, multicast routing can be implemented as long as the
corresponding multicast routing entries are created through unicast routes. PIM uses the reverse path
forwarding (RPF) mechanism to implement multicast forwarding. When a multicast packet arrives on an
interface of the device, it undergoes an RPF check. If the RPF check succeeds, the device creates the
corresponding routing entry and forwards the packet. If the RPF check fails, the device discards the
packet. For more information about RPF, see "
Configuring multicast routing and forwarding
."
Based on the implementation mechanism, PIM falls into the following categories:
Protocol Independent Multicast–Dense Mode (PIM-DM)
Protocol Independent Multicast–Sparse Mode (PIM-SM)
Protocol Independent Multicast Source-Specific Multicast (PIM-SSM)
The term "router" in this document refers to both routers and Layer 3 switches.
PIM-DM overview
PIM-DM is a type of dense mode multicast protocol. It uses the push mode for multicast forwarding, and
is suitable for small-sized networks with densely distributed multicast members.
The basic implementation of PIM-DM is as follows:
PIM-DM assumes that at least one multicast group member exists on each subnet of a network.
Therefore, multicast data is flooded to all nodes on the network. Then, branches without multicast
forwarding are pruned from the forwarding tree, leaving only those branches that contain receivers.
This flood-and-prune process takes place periodically. Pruned branches resume multicast
forwarding when the pruned state times out. Data is then flooded again down these branches, and
then the branches are pruned again.
When a new receiver on a previously pruned branch joins a multicast group, to reduce the join
latency, PIM-DM uses a graft mechanism to resume data forwarding to that branch.
Generally speaking, the multicast forwarding path is a source tree. That is, it is a forwarding tree with the
multicast source as its "root" and multicast group members as its "leaves." Because the source tree is the
shortest path from the multicast source to the receivers, it is also called a shortest path tree (SPT).
The working mechanism of PIM-DM is summarized as follows:
Neighbor discovery
SPT building
Graft
Assert