D-Link DES-3326SRM Product Manual - Page 160

DVMRP Interface Configuration, DVMRP Interface Configuration

Page 160 highlights

D-Link DES-3326S Layer 3 Switch DVMRP Interface Configuration To configure DVMRP for an IP interface, Click the DVMRP Interface Configurations link from the IP Multicast Routing Protocols folder: Figure 21- 6. DVMRP Interface Configuration Figure 21- 7. DVMRP Interface Configuration − Edit This menu allows the Distance-Vector Multicast Routing Protocol to be configured for each IP interface defined on the switch. The Distance Vector Multicast Routing Protocol (DVMRP) is a hop-based method of building multicast delivery trees from multicast sources to all nodes of a network. Because the delivery trees are 'pruned' and 'shortest path', DVMRP is relatively efficient. Because multicast group membership information is forwarded by a distance-vector algorithm, propagation is slow. DVMRP is optimized for high delay (high latency) relatively low bandwidth networks, and can be considered as a 'best-effort' multicasting protocol. DVMRP resembles the Routing Information Protocol (RIP), but is extended for multicast delivery. It relies upon RIP hop counts to calculate 'shortest paths' back to the source of a multicast message, but defines a 'route cost' to calculate which branches of a multicast delivery tree should be 'pruned' - once the delivery tree is established. When a sender initiates a multicast, DVMRP initially assumes that all users on the network will want to receive the multicast message. When an adjacent router receives the message, it checks its unicast routing table to determine the interface that gives the shortest path (lowest cost) back to the source. If the multicast was received over the shortest path, then the adjacent router enters the information into its tables and forwards the message. If the message is not received on the shortest path back to the source, the message is dropped. Route cost is a relative number that is used by DVMRP to calculate which branches of a multicast delivery tree should be 'pruned'. The 'cost' is relative to other costs assigned to other DVMRP routes throughout the network. The higher the route cost, the lower the probability that the current route will be chosen to be an active branch of the multicast delivery tree (not 'pruned') - if there is an alternative route. 150

  • 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

D-Link DES-3326S Layer 3 Switch
DVMRP Interface Configuration
To configure DVMRP for an IP interface, Click the DVMRP Interface Configurations link from the IP Multicast Routing
Protocols folder:
Figure 21- 6. DVMRP Interface Configuration
Figure 21- 7. DVMRP Interface Configuration
Edit
This menu allows the Distance-Vector Multicast Routing Protocol to be configured for each IP interface defined on the switch.
The Distance Vector Multicast Routing Protocol (
DVMRP
) is a hop-based method of building multicast delivery trees from
multicast sources to all nodes of a network. Because the delivery trees are ‘pruned’ and ‘shortest path’, DVMRP is relatively
efficient. Because multicast group membership information is forwarded by a distance-vector algorithm, propagation is slow.
DVMRP is optimized for high delay (high latency) relatively low bandwidth networks, and can be considered as a ‘best-effort’
multicasting protocol.
DVMRP resembles the Routing Information Protocol (RIP), but is extended for multicast delivery. It relies upon RIP hop
counts to calculate ‘shortest paths’ back to the source of a multicast message, but defines a ‘route cost’ to calculate which
branches of a multicast delivery tree should be ‘pruned’ – once the delivery tree is established.
When a sender initiates a multicast, DVMRP initially assumes that all users on the network will want to receive the multicast
message. When an adjacent router receives the message, it checks its unicast routing table to determine the interface that gives
the shortest path (lowest cost) back to the source. If the multicast was received over the shortest path, then the adjacent router
enters the information into its tables and forwards the message. If the message is not received on the shortest path back to the
source, the message is dropped.
Route cost is a relative number that is used by DVMRP to calculate which branches of a multicast delivery tree should be
‘pruned’. The ‘cost’ is relative to other costs assigned to other DVMRP routes throughout the network.
The higher the route cost, the lower the probability that the current route will be chosen to be an active branch of the multicast
delivery tree (not ‘pruned’) – if there is an alternative route.
150