Transparent Bridging & Spanning Trees
The spanning tree algorithm involves all the bridges regularly exchanging special frames known as BDPUs. (Bridge Protocol Data Unit)
- Each bridge has a priority value and a unique identifier (ID)
- For the total bridged LAN, a single bridge is dynamically chosen to be the root bridge.
- This is the bridge with the highest priority. It is determined/confirmed at regular intervals