Networked Life: 20 Questions and Answers by Mung Chiang Capter 13. Can you answer the exercise 13.2?

13.2 Routing Information Protocol (RIP)

Consider a network with topology, as shown in Figure 13.2.

a. Run an example of RIP on this network to find the least routes between all nodes. Show routing tables for each step.

Figure 13.11 A small graph for an example of RIP

b. Now the connection between A and C collapses, resulting in a cost equal to for the two directions of the transfer. B and C immediately perceive the connection collapse and refresh their own the routing tables for four reps after its failure connection. You must only show the routing tables that have changed. What happens with the routes to A?

c. Suggest a solution to the problem that appeared in (b).

2 3 6 2 3 6