In Spanning Tree Protocol, a root switch is selected at first, and then somehow, the shortest path from each other switch to the root is obtained. Thus we established a tree network.
My questions are:
- After the tree network is established, does the root switch act as a center in the network? In other words, all the traffic originated from other switch would first flow into the root switch along the shortest path and then routed to its destination by the root switch, also along the shortest path.
- If it's not the case, why does the protocol calculate a tree such that the path between each non-root switches and the root is minimized? As far as I can see, a minimum spanning tree would work better, which is not difficult to calculate.