2010 June UGC NET Paper 1
February 13, 2024Question 2800 – 2012 June UGC NET Paper 1
February 13, 2024GATE 2005-IT
|
Question 29
|
Count to infinity is a problem associated with
|
link state routing protocol.
|
|
|
distance vector routing protocol.
|
|
|
DNS while resolving host name.
|
|
|
TCP for congestion control.
|
Question 29 Explanation:
Distance vector routing protocol uses the Bellman-Ford algorithm and Ford-Fulkerson algorithm.
The Bellman-Ford algorithm does not prevent routing loops from happening and suffers from the count-to-infinity problem.
The Bellman-Ford algorithm does not prevent routing loops from happening and suffers from the count-to-infinity problem.
Correct Answer: B
Question 29 Explanation:
Distance vector routing protocol uses the Bellman-Ford algorithm and Ford-Fulkerson algorithm.
The Bellman-Ford algorithm does not prevent routing loops from happening and suffers from the count-to-infinity problem.
The Bellman-Ford algorithm does not prevent routing loops from happening and suffers from the count-to-infinity problem.