Question

Figure 1: Network for Problem 4 and 5 4. [10 pointsj: Link-state routing: (a) Explain how link-state routing works. Give an example of an Internet routing protocol based on link-state routing. b) Apply Dijkstra's algorithm to obtain the routing table for node a in the network given in Figure 1 5. [10 points Apply distance-vector routing to the subnetwork of the network shown in Figure 1 con sisting of only nodes fa, b, c, d (a) Write the initial distance-vector tables for all nodes. (b) Obtain the distance-vector tables for two subsequent rounds of distance-vector routing assuming a synchronous mode of operation. Have all of the distance vectors converged? Explain.

Answer 1

Given network Nodes are a, b, c, d Distance vector Routing is dynamic Routenup Each rater maintain the Rating Information take (RIT) The Initial distance vector taken for all nodes \r\n Given network Nodes are a, b, c, d Distance vector Routing is dynamic Routenup Each rater maintain the Rating Information take (RIT) The Initial distance vector taken for all nodes \r\n Node (a) Rating Information total The distance a to a is o The distance a to b is 2 The distance a to c is 7 The distance between a to d Then is Infinite because there is no direct Lines a to d Node (b) Rating table \r\n Node (c) Rating table for C Node (d) Rating table information The distance between nodes is infinite because then is no direct lines The fifth rating table are (Initial Rating table Information)