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?
(A)
For shortest path routing between LANs
(B)
For avoiding loops in the routing paths
(C)
For fault tolerance
(D)
For minimizing collisions
Answer: (B)
Explanation:
The correct answer is (B) For avoiding loops in the routing paths.
The spanning tree algorithm is used for bridge-routing in a network of LANs connected by bridges primarily to avoid loops in the routing paths. When multiple paths exist between two LANs, without a mechanism to prevent loops, packets could continuously circulate between bridges and create network congestion or even cause network failures.
By using the spanning tree algorithm, a loop-free tree-like structure is created among the bridges, ensuring that there is only one path between any two LANs. This path is determined in such a way that it minimizes the number of bridges involved in the routing process, optimizing the efficiency and stability of the network.
The other options mentioned (A) shortest path routing, (C) fault tolerance, and (D) minimizing collisions are not the primary reasons for using the spanning tree algorithm in bridge-routing. While the spanning tree algorithm indirectly helps with some aspects like providing fault tolerance by avoiding loops, its primary purpose is to establish a loop-free routing structure.
See Spanning Tree Protocol for more details.
Quiz of this Question
Please comment below if you find anything wrong in the above post