• edited by
726 views

1 Answer

Position:
Show:

Related questions

1 1 vote
1 1 answer
367
367 views
gopal_gate asked May 17, 2025
367 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...
1 1 vote
1 1 answer
4.0k
4.0k views
Na462 asked Dec 2, 2018
3,951 views
D.
0 0 votes
0 0 answers
1.8k
1.8k views
John Doe asked Nov 24, 2018
1,787 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 ...