ZyXEL NWA-3163 User Guide - Page 144

Spanning Tree Protocol STP

Page 144 highlights

Chapter 8 Wireless Screen 8.3.1 Spanning Tree Protocol (STP) Spanning Tree Protocol (STP) detects and breaks network loops and provides backup links between switches, bridges or routers. It allows a bridge to interact with other STP-compliant bridges in your network to ensure that only one route exists between any two stations on the network. 8.3.1.1 Rapid STP The NWA uses IEEE 802.1w RSTP (Rapid Spanning Tree Protocol) that allow faster convergence of the spanning tree (while also being backwards compatible with STP-only aware bridges). Using RSTP topology change information does not have to propagate to the root bridge and unwanted learned addresses are flushed from the filtering database. In RSTP, the port states are Discarding, Learning, and Forwarding. 8.3.1.2 STP Terminology The root bridge is the base of the spanning tree; it is the bridge with the lowest identifier value (MAC address). Path cost is the cost of transmitting a frame onto a LAN through that port. It is assigned according to the speed of the link to which a port is attached. The slower the media, the higher the cost - see the following table. Table 27 STP Path Costs LINK SPEED Path Cost Path Cost Path Cost Path Cost Path Cost Path Cost 4Mbps 10Mbps 16Mbps 100Mbps 1Gbps 10Gbps RECOMMENDE RECOMMENDE ALLOWED D VALUE D RANGE RANGE 250 100 to 1000 1 to 65535 100 50 to 600 1 to 65535 62 40 to 400 1 to 65535 19 10 to 60 1 to 65535 4 3 to 10 1 to 65535 2 1 to 5 1 to 65535 On each bridge, the root port is the port through which this bridge communicates with the root. It is the port on this switch with the lowest path cost to the root (the root path cost). If there is no root port, then this bridge has been accepted as the root bridge of the spanning tree network. For each LAN segment, a designated bridge is selected. This bridge has the lowest cost to the root among the bridges connected to the LAN. 144 NWA-3160 Series User's Guide

  • 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

Chapter 8 Wireless Screen
NWA-3160 Series User’s Guide
144
8.3.1
Spanning Tree Protocol (STP)
Spanning Tree Protocol (STP) detects and breaks network loops and provides
backup links between switches, bridges or routers. It allows a bridge to interact
with other STP-compliant bridges in your network to ensure that only one route
exists between any two stations on the network.
8.3.1.1
Rapid STP
The NWA uses IEEE 802.1w RSTP (Rapid Spanning Tree Protocol) that allow faster
convergence of the spanning tree (while also being backwards compatible with
STP-only aware bridges). Using RSTP topology change information does not have
to propagate to the root bridge and unwanted learned addresses are flushed from
the filtering database. In RSTP, the port states are Discarding, Learning, and
Forwarding.
8.3.1.2
STP Terminology
The root bridge is the base of the spanning tree; it is the bridge with the lowest
identifier value (MAC address).
Path cost is the cost of transmitting a frame onto a LAN through that port. It is
assigned according to the speed of the link to which a port is attached. The slower
the media, the higher the cost - see the following table.
On each bridge, the root port is the port through which this bridge communicates
with the root. It is the port on this switch with the lowest path cost to the root (the
root path cost). If there is no root port, then this bridge has been accepted as the
root bridge of the spanning tree network.
For each LAN segment, a designated bridge is selected. This bridge has the lowest
cost to the root among the bridges connected to the LAN.
Table 27
STP Path Costs
LINK SPEED
RECOMMENDE
D VALUE
RECOMMENDE
D RANGE
ALLOWED
RANGE
Path Cost
4Mbps
250
100 to 1000
1 to 65535
Path Cost
10Mbps
100
50 to 600
1 to 65535
Path Cost
16Mbps
62
40 to 400
1 to 65535
Path Cost
100Mbps
19
10 to 60
1 to 65535
Path Cost
1Gbps
4
3 to 10
1 to 65535
Path Cost
10Gbps
2
1 to 5
1 to 65535