Content deleted Content added
m bridging link |
No edit summary |
||
Line 4:
Its structure corresponds to that of the [[spanning tree (mathematics)|spanning tree]] in [[graph theory]]. Networks must have only one path to any destination active at any one point in time to avoid the same [[frame (telecommunications)|frame]] arriving at the destination multiple times, causing dysfunction. The [[minimum spanning tree]] algorithm ensures that if multiple paths exist to the same destination then all but one will be blocked.
Redundant networks can be built in this way, however the [[latency (engineering)|latency]] of spanning tree decisions must be taken into account as by default the maximum time for recalculations of the minimum spanning tree is 30 seconds. During this time no network traffic will be able to pass through ports involved in the recalculations.
A ''root bridge'' is automatically selected by the algorithm as the root of the minimum spanning tree. As with most networking protocols this is highly configurable and therefore any networking device could be forced into this role.
| |||