Consider the network topology given in Figure 1. Figure 1: Network topology for Question 1.

(a) Suppose all the routers in Figure 1 are running the Distance Vector (DV) routing protocol. Show that a routing loop may occur if the link between routers E and F fails. You must show the cost you assumed for each of the links to find the routing loop. You answer should include a clear description of how the network ends up with a routing loop.

(b) Show that the routing loop found in (a) will also cause the count to infinity problem.

(c) Show that the poisoned reverse technique discussed in class is unable the prevent the count to infinity problem.

(d) The Wikipedia article on routing loop mentions some of the techniques used for prevention and mitigation of the routing loop problem. Do some research on these techniques online and discuss which of these techniques may be used to prevent/mitigate the routing loop problem found in (a).

Figure I: Network topology for