Specifications

Functions
106
4.4 Spanning Tree Algorithm
RS2-4R
Release 1.0 03/04
The path from bridge 6 to the root bridge is interesting:
D The path via bridges 5 and 3 generates the same root path costs as the
path via bridges 4 and 2.
D The path via bridge 4 is selected because the bridge identifier 40 is
numerically less than 50.
D There are however two paths between bridge 6 and bridge 4. In this case,
the larger port priority is decisive.
Fig. 35: Root path determination example
Bridge 5
Bridge 6
Bridge 4
Root path
Bridge 2
Bridge 3
Bridge 1
Port 3
Port 1 Port 2
Bridge 7
Redundant path
BID Bridge identification
BID =40 BID =50
BID =30BID =20
BID =10
BID =70
BID =60