Consider the network given in the previous question. Suppose we use distance vector routing to compute the next hops to destination F from all other nodes. Assume that split horizon with poisonous reverse is employed.

Consider the network above. Suppose each link is labeled by its delay. Assume that distance vector routing is used to compute the shortest paths, i.e., the paths with the minimum delay. Also, assume that the algorithm has converged (i.e., no more changes in the distance table, and each node has found the shortest paths to all potential destination nodes). The shortest path from D to F is through neighbor E, with cost = 4 (D->E->F).

1. Show the spanning tree for Figure 2 that consists of the shortest paths from all nodes to F.

2. (4 pts.) What will be the next hop to reach destination node F in the routing tables at each of the nodes? Fill in the following table.

Dest	Nexthop
A
B
D
E
F

3. (8 pts.) Show the resulting distance tables at nodes C and D by filling in the following table. The destination node is not shown explicitly as we are concerned only with a single destination F.

Distance Table at C
Via
B	D	E	F

Distance Table at D
Via
A	B	C	E

4. What distance to F does D announce to each of the neighbors A, B, C, and E?

5. Now suppose link E-F goes down. What distance to F does E announce to neighbor C and D?

6. What will be the resulting converged new distance tables at C after several distance vector exchanges?

Distance Table at C
Via
B	D	E	F

2 Figure 2