608 views
0 votes
0 votes
.In which routing algorithm each router exchanges information about the entire network with neighbouring
routers at regular intervals
a) Link state Routing  b) Distance vector C) Form state  d) Dalagram link

1 Answer

2 votes
2 votes

b) Distance vector ...

 

1. It is a dynamic routing algorithm in which each router computes a distance between itself and each possible destination i.e. its immediate neighbors.

2. The sharing of information with the neighbors takes place at regular intervals.

3. It makes use of Bellman-Ford Algorithm for making routing tables.

4. As the requesting router receives updates from different neighbouring routers it will only update the reachable networks in its routing table ....

 

1. https://gateoverflow.in/206134/Uttrakhand-asst-professor-exam-59 

 

2. https://en.wikipedia.org/wiki/Routing_Information_Protocol

 

 

Related questions

4 votes
4 votes
1 answer
1
2 votes
2 votes
0 answers
3
Sajal Mallick asked Dec 2, 2023
215 views
In first option one bit error to merge two consecutive frames into one – I cannot understand this. B should be 2^k/2-1 for selective reject. It should be false . Right...