Scribd
Upload
25 views1 page

Loop Problem

Redundant bridges can cause loop problems by continuously forwarding frames between LANs. The spanning tree algorithm selects a root bridge and designates forwarding ports to create a logical tree topology over the physical topology, preventing loops. It selects root ports providing the lowest cost path to the root bridge and marks all other ports as blocking to ensure only one path between any pair of LAN segments.

Uploaded by

Amrit Jot
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views1 page

Loop Problem

Redundant bridges can cause loop problems by continuously forwarding frames between LANs. The spanning tree algorithm selects a root bridge and designates forwarding ports to create a logical tree topology over the physical topology, preventing loops. It selects root ports providing the lowest cost path to the root bridge and marks all other ports as blocking to ensure only one path between any pair of LAN segments.

Uploaded by

Amrit Jot
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Loop Problem Forwarding and learning processes work without any problem as long as there is no redundant bridge in the

system. On the other hand, redundancy is desirable from the viewpoint of reliability, so that the function of a failed bridge is taken over by a redundant bridge. Assuming that after initialization tables in both the bridges are empty let us consider the following steps: Step 1. Station-A sends a frame to Station-B. Both the bridges forward the frame to LAN Y and update the table with the source address of A. Step 2. Now there are two copies of the frame on LAN-Y. The copy sent by Bridge-a is received by Bridge-b and vice versa. As both the bridges have no information about Station B, both will forward the frames to LAN-X. Step 3. Again both the bridges will forward the frames to LAN-Y because of the lack of information of the Station B in their database and again Step-2 will be repeated, and so on. So, the frame will continue to loop around the two LANs indefinitely. Spanning Tree: As redundancy creates loop problem in the system it is very undesirable. To prevent loop problem and proper working of the forwarding and learning processes, there must be only one path between any pair of bridges and LANs between any two segments in the entire bridged LAN. The IEEE specification requires that the bridges use a special topology. Such a topology is known as spanning tree (a graph where there is no loop) topology. The methodology for setting up a spanning tree is known as spanning tree algorithm, which creates a tree out of a graph. Without changing the physical topology, a logical topology is created that overlay on the physical one by using the following steps: Select a bridge as Root-bridge, which has the smallest ID. Select Root ports for all the bridges, except for the root bridge, which has leastcost path (say minimum number of hops) to the root bridge. Choose a Designated bridge, which has least-cost path to the Root-bridge, in each LAN. Select a port as Designated port that gives least-cost path from the Designated bridge to the Root bridge. Mark the designated port and the root ports as Forwarding ports and the remaining ones as Blocking ports.

You might also like