In ....... routing the least cost route between any two nodes is the minimum distance.

  1. Home

Question: In ....... routing the least cost route between any two nodes is the minimum distance.

1.path vector

2. distance vector

3.link state

4.switching

Posted by R4R Team
  1. In ....... routing the least cost route between any two nodes is the minimum distance.
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!