In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?
For shortest path routing between LANs
For avoiding loops in the routing paths
For fault tolerance
For minimizing collisions
The answer is (B).
Since, in a spanning tree, there is a unique path from a source to the destination, which avoids loops, since it is a tree, and contains all the nodes, since it is a spanning tree.
Ref : https://en.wikipedia.org/wiki/Spanning_Tree_Protocol
I think the translation looks like Tag=29...
What significance does this line holds in this...
First of all, congratulations!