Question: Q.1) Give the distance vector table for networks shown below when (a) Each node knows only the distances to its immediate neighbors. (b) Each
Q.1) Give the distance vector table for networks shown below when (a) Each node knows only the distances to its immediate neighbors. (b) Each node has reported the information it had in the preceding step to its immediate neighbors. (c) Step (b) happens a second time. 2 B O A 2 5 B 2 Q.2) Give the steps for forward search algorithm using link state routing as it build the routing table for node A in the network shown E E 4 D A 3 E
Step by Step Solution
3.45 Rating (158 Votes )
There are 3 Steps involved in it
Answer 1 Answer 2 Link State Routing has two phases Reliable Flooding Initial state Each node knows the cost of its neighbors Final state Each node knows the entire graph Route Calculation Each node u... View full answer
Get step-by-step solutions from verified subject matter experts
