Exit Zen
88
../../protocols/ethernet.rst:358
English
2000
0/100 · 4
89
../../protocols/ethernet.rst:359
English
100 Gbps
0/100 · 8
90
../../protocols/ethernet.rst:359
English
200
0/100 · 3
91
../../protocols/ethernet.rst:362
English
The `Spanning Tree Protocol` uses its own terminology that we illustrate in the figure above. A switch port can be in three different states : `Root`, `Designated` and `Blocked`. All the ports of the `root` switch are in the `Designated` state. The state of the ports on the other switches is determined based on the `BPDU` received on each port.
0/3460 · 346
92
../../protocols/ethernet.rst:364
English
The `Spanning Tree Protocol` uses the ordering relationship to build the spanning tree. Each switch listens to `BPDUs` on its ports. When `BPDU = <R,c,T,p>` is received on port `q`, the switch computes the port's `root priority vector`: `V[q] = <R,c+cost[q],T,p,q>` , where `cost[q]` is the cost associated to the port over which the `BPDU` was received. The switch stores in a table the last `root priority vector` received on each port. The switch then compares its own `identifier` with the smallest `root identifier` stored in this table. If its own `identifier` is smaller, then the switch is the root of the spanning tree and is, by definition, at a distance `0` of the root. The `BPDU` of the switch is then `<R,0,R,p>`, where `R` is the switch `identifier` and `p` will be set to the port number over which the `BPDU` is sent.
0/8340 · 834
93
../../protocols/ethernet.rst:366
English
Otherwise, the switch chooses the best priority vector from its table, `bv = <R,c+cost[q'],T,p,q'>`. The port `q'`, over which this best root priority vector was learned, is the switch port that is closest to the `root` switch. This port becomes the `Root` port of the switch. There is only one `Root` port per switch (except for the `Root` switches whose ports are all `Designated`). The switch can then compute its own `BPDU` as `BPDU = <R,c',S,p>` , where `R` is the `root identifier`, `c'` the cost of the best root priority vector, `S` the identifier of the switch and `p` will be replaced by the number of the port over which the `BPDU` will be sent.
0/6560 · 656
94
../../protocols/ethernet.rst:368
English
To determine the state of its other ports, the switch compares its own `BPDU` with the last `BPDU` received on each port. Note that the comparison is done by using the `BPDUs` and not the `root priority vectors`. If the switch's `BPDU` is better than the last `BPDU` of this port, the port becomes a `Designated` port. Otherwise, the port becomes a `Blocked` port.
0/3640 · 364
95
../../protocols/ethernet.rst:370
English
The state of each port is important when considering the transmission of `BPDUs`. The root switch regularly sends its own `BPDU` over all of its (`Designated`) ports. This `BPDU` is received on the `Root` port of all the switches that are directly connected to the `root switch`. Each of these switches computes its own `BPDU` and sends this `BPDU` over all its `Designated` ports. These `BPDUs` are then received on the `Root` port of downstream switches, which then compute their own `BPDU`, etc. When the network topology is stable, switches send their own `BPDU` on all their `Designated` ports, once they receive a `BPDU` on their `Root` port. No `BPDU` is sent on a `Blocked` port. Switches listen for `BPDUs` on their `Blocked` and `Designated` ports, but no `BPDU` should be received over these ports when the topology is stable. The utilization of the ports for both `BPDUs` and data frames is summarized in the table below.
0/9330 · 933
96
../../protocols/ethernet.rst:373
English
Port state
0/100 · 10
97
../../protocols/ethernet.rst:373
English
Receives BPDUs
0/140 · 14
98
../../protocols/ethernet.rst:373
English
Sends BPDU
0/100 · 10
99
../../protocols/ethernet.rst:373
English
Handles data frames
0/190 · 19
100
../../protocols/ethernet.rst:375
English
Blocked
0/100 · 7
101
../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:376 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377 • ../../protocols/ethernet.rst:377
English
yes
0/100 · 3
102
../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376
English
no
0/100 · 2
103
../../protocols/ethernet.rst:376
English
Root
0/100 · 4
104
../../protocols/ethernet.rst:377
English
Designated
0/100 · 10
105
../../protocols/ethernet.rst:382
English
To illustrate the operation of the `Spanning Tree Protocol`, let us consider the simple network topology in the figure below.
0/1250 · 125
106
../../protocols/ethernet.rst:389
English
A simple Spanning tree computed in a switched Ethernet network
0/620 · 62
107
../../protocols/ethernet.rst:391
English
Assume that `Switch4` is the first to boot. It sends its own `BPDU = <4,0,4,1>` (resp. `BPDU = <4,0,4,2>`) on port 1 (resp. port 2). When `Switch1` boots, it sends `BPDU = <1,0,1,1>`. This `BPDU` is received by `Switch4`, which updates its `BPDU` and root priority vector tables and computes a new `BPDU = <1,3,4,1>` (resp. `BPDU = <1,3,4,2>`) on port 1 (resp. port 2). Indeed, there is only one root priority vector and hence, it is the best one. Port 1 of `Switch4` becomes the `Root` port while its second port is still in the `Designated` state.
0/5490 · 549