algorithm. Consider the following network. Suppose all bridges execute spanning tree Host 1 E B2 1...

Transcribed Image Text:

algorithm. Consider the following network. Suppose all bridges execute spanning tree Host 1 E B2 1 B3 B6 1 D BS 1 12 B4 1 Host 2 B B7 2 1 F H K a. List the elected root, the port selected by each bridge as the preferred path to the root, and the designate bridge elected by each LAN. b. Initially all bridges hold empty forwarding tables. Suppose that Host1 sends a packet to Host2. The packet is forwarded through the spanning tree. Show the forwarding table for each bridge. c. Follow sub-question b, suppose that Host2 replies a packet to Host1. The packet is forwarded through the spanning tree. Show the forwarding table for each bridge. algorithm. Consider the following network. Suppose all bridges execute spanning tree Host 1 E B2 1 B3 B6 1 D BS 1 12 B4 1 Host 2 B B7 2 1 F H K a. List the elected root, the port selected by each bridge as the preferred path to the root, and the designate bridge elected by each LAN. b. Initially all bridges hold empty forwarding tables. Suppose that Host1 sends a packet to Host2. The packet is forwarded through the spanning tree. Show the forwarding table for each bridge. c. Follow sub-question b, suppose that Host2 replies a packet to Host1. The packet is forwarded through the spanning tree. Show the forwarding table for each bridge.

Answer rating: 100% (QA)

a Elected root BS1 Preferred path to root for each bridg... View the full answer