Computer Networks

4. Consider the network shown in the following diagram. i. Use Dijkstra's link-state algorithm to compute the forwarding table for F. To get credit for this question, you should show all calculations of the algorithm. ii. For the network topology in Q.4, consider Distance Vector algorithm for the routing process. Show all the calculations to find updated table for node B after the 2nd step