edited by
659 views
1 votes
1 votes

Consider the diagram shown where number of LANs are connected by bridges.In order to avoid the loops, these bridges arrange themselves into a spanning tree. The root bridge identified as bridge with least serial number. Next each bridge identifies a port through which it can forward packets to root bridge. If Multiple ports are there, the one which have lower index have the high priority.If Multiple bridges are there to forward a packet to a LAN, the one which is near to root bridge will get prefered and in that the one which has lowest ID will gets prefered.

If host from LAN-1 wants to send packet to a host in LAN-4, what will be the forwarding table at B3 bridge.

  1.   LAN-1 -> port-1, LAN-2 -> port-2, LAN-3 -> port-1, LAN-4 -> port-1
  2.   LAN-1 -> port-1, LAN-2 -> port-1, LAN-3 -> port-3, LAN-4 -> port-2
  3.   LAN-1 -> port-1, LAN-2 -> port-1, LAN-3 -> port-2, LAN-4 -> port-3
  4.   LAN-1 -> port-1, LAN-2 -> port-2, LAN-3 -> port-2, LAN-4 -> port-3
edited by

1 Answer

Related questions

1 votes
1 votes
2 answers
3
1 votes
1 votes
0 answers
4
Na462 asked Feb 19, 2018
617 views
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same2. Mst will remain sameRight?Note ...