Question: I need help in this question Routing Algorithms Consider the network shown above. a) Suppose that each node is running Dijkstra's link state (LS) routing

I need help in this question
Routing Algorithms Consider the network shown above. a) Suppose that each node is running Dijkstra's link state (LS) routing algorithm. Starting from air empty tree, determine the order in which the nodes are placed in D's shortest path tree. Break ties using the alphabetical order (eg. B before C). D-_____-_____-_____-_____-_____ b) Now suppose that each node is running the distributed distance vector (DV) routing algorithm. What are D's final distance table entries? c) Suppose that at time t, the cost of the AC link changes to 1 and as a result, nodes A and C initiate the DV algorithm. Approximately how many iterations are required until D's distance table converges? Assume that the DV algorithm runs synchronously (with each node exchanging information with its neighbors and recomputing its own distance table values at each iteration)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
