For the topology shown A B5 E G B4 B1 B7 B6 D B3 B8 B2...

 

Transcribed Image Text:

For the topology shown A B5 E G B4 B1 B7 B6 D B3 B8 B2 B B9 H F a) (10 pts).Fill in the configuration message (Root ID, Cost, Transmitter ID) for each bridge and each LAN segment at the steady state (after convergence) b) (3 pts). Indicate which ports are root ports (using solid circles), designated ports (using hollow circles) or blocked ports (using crosses). c) (6 pts). Based on the spanning tree constructed, list the path (i.e. LAN segments and bridges by-passed) between each pair of LANs. d) (6 pts).Compute the number of hops (bridges) between each pair of LANs using the spanning tree, and compare them to the shortest number of hops via shortest path routing. For the topology shown A B5 E G B4 B1 B7 B6 D B3 B8 B2 B B9 H F a) (10 pts).Fill in the configuration message (Root ID, Cost, Transmitter ID) for each bridge and each LAN segment at the steady state (after convergence) b) (3 pts). Indicate which ports are root ports (using solid circles), designated ports (using hollow circles) or blocked ports (using crosses). c) (6 pts). Based on the spanning tree constructed, list the path (i.e. LAN segments and bridges by-passed) between each pair of LANs. d) (6 pts).Compute the number of hops (bridges) between each pair of LANs using the spanning tree, and compare them to the shortest number of hops via shortest path routing.

Answer rating: 100% (QA)

The provided information describes a spanning tree which is a network topology that eliminates loops while allowing all devices to communicate with each other Bridges are used to connect different LAN ... View the full answer