$4$ Count$-$to$-$infinity Problem

In the above network, links are labeled with costs. Assume we use the basic distance vector

algorithm.

a$)$ Give the routing table.

b$)$ What will happen if the link between B and D fails? Perform the first three iterations of

the algorithm following the failure.

c$)$ Assume each node broadcasts its routing information every t seconds, calculate how long

it takes for the routing tables on different nodes to become stable again.

d$)$ In class, we have discussed poisoned reverse. Explain how poisoned reverse fixes this

problem.

e$)$ Identify a scenario using the network given in which poisoned reverse fails.