Question: For the network shown below give global distancevector tables like those in the textbook when (a) Each node knows only the distances to its immediate

For the network shown below give global distancevector tables like those in the textbook 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.
(d) At some time link B-C fails.Give the routing tables at A and D after B and C have reported the news.
(e) part D cont'd. Give the routing tables at A and D after their next mutual exchange.
(f) For the network given in the figure above, show how the link-state forward search algorithm algorithm builds the routing table for node E. Use a link state routing table(i.e steps, confirmed and tentative)
ANSWER ALL SECTIONS PLEASE
5 1 . B E 3 1 4 D 2 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
