Quiz8

Suppose all switch tables in Figure 1 are empty. If Z sends a packet to Y, which switches learn how to forward to Z?

B3, B2, and B1

Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. What will be the predecessor to node E in the shortest path spanning tree.

C

Multiple Answer] Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. Which of the following links even if they go down do not affect the forwarding from A to any destination.

C-F B-C C-D

Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. Which node will be added to N' (set of nodes whose least cost path is definitively known) in step 3?

E

[Multiple Answer] Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. Which of the following links will be part of the shortest path spanning tree.

E-F A-C A-D

[Multiple Answer] Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. Which of the following nodes have cost of at the initialization step?

F E

[Multiple Answer] Consider the network in Figure 1, where Dijkstra's algorithm is used to find the shortest paths from A to all other nodes. Which of the following destinations have C as the next hop in the forwarding table at A?

F E C

Suppose all switches in Figure 1 know how to forward to Y. If Z sends a packet to Y, which switches learn how to forward to Z?

Only B3 and B2

Suppose all switches in Figure 1 know how to forward to Y. If Z sends a packet to Y, which hosts' interfaces see this packet?

Only Y

Suppose all switch tables in Figure 1 are empty. If Z sends a packet to Y, which hosts' interfaces see this packet?

W, X, Y