BridgesforHW3

# BridgesforHW3 - Bridged LAN example We run the spanning...

This preview shows pages 1–2. Sign up to view the full content.

Bridged LAN example: We run the spanning tree algorithm on the following LAN. If you do not see a cost for LAN, you can assume they all have equal cost of 1. However to look at a more general case, some of the LAN segments in this example have a cost 3 times that of others. Here to better understand the algorithm, we develop the answer in a series of pictures instead of cluttering up one picture. DC means designated cost for a LAN segment. B1 means bridge number 1. A plain number in a box on a bridge is a port number. Step 1 of the algorithm is already shown in the first picture: Bridge 1 is chosen as the root bridge since all the bridges are assumed to have the same priority. The tie is broken by choosing the bridge with the smallest ID number. Next we determine the root path cost (RPC) for each port on each bridge other than the root bridge. Then each bridge other than the root chooses its port with the lowest RPC as the root port (RP). Ties are broken by choosing the lowest-numbered port.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

BridgesforHW3 - Bridged LAN example We run the spanning...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online