1,481 views
0 0 votes

Suppose that forwarding table are all established then,

What will be the table for A immediately after the link A-E goes down? Is it that the distance to all other nodes is marked infinite? If it not so, then how the table for node A finally gets stabilized?

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
1 1 answer
352
352 views
gopal_gate asked May 17, 2025
352 views
Distance-Vector Routing Algorithm written in FOROUZAN:Distance_Vector_Routing ( ) { // Initialize (create initial vectors for the node) D[myself] = 0 for (y = 1 to N) { i...
0 0 votes
1 answers 1 answer
708
708 views
RamaSivaSubrahmanyam asked Oct 27, 2022
708 views
Asynchronous: It does not require that all of its nodes operate in the lock step with each other.What does this mean?
1 1 vote
1 1 answer
3.9k
3.9k views
Na462 asked Dec 2, 2018
3,864 views
D.
0 0 votes
0 0 answers
1.8k
1.8k views
John Doe asked Nov 24, 2018
1,766 views
At the beginning each node knows only the distances to its immediate neighbors. In step 1, each node exchanges its routing table with all of its neighbors and all update ...