search
Log In
14 votes
2.9k views

Count to infinity is a problem associated with:

  1. link state routing protocol.
  2. distance vector routing protocol
  3. DNS while resolving host name
  4. TCP for congestion control
in Computer Networks
edited by
2.9k views
0

This Might help ......

3 Answers

14 votes
 
Best answer

Answer is B.

Distance vector routing.


edited by
7 votes
Count to infinitiy problem is associated with DVR.And it cn be removed by the split horizon solution but still low convergence exist into DVR.
2
split horizon works only for 2 nodes , for 3 nodes , it might fail
0
who says it will fail for 3 nodes??
0

Snap from Forouzan. Solution to 3 node instability cannot be guaranteed by split horizon

0 votes
Answer: B
0
Answer :B
Answer:

Related questions

42 votes
7 answers
1
7.9k views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. ... to node $A$ at time $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 7.9k views
23 votes
5 answers
2
3k views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. ...
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 3k views
34 votes
7 answers
3
6.4k views
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. Suppose the weights of all unused links are changed to $2$ and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused? $0$ $1$ $2$ $3$
asked Apr 21, 2016 in Computer Networks jothee 6.4k views
42 votes
5 answers
4
10.6k views
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ ... $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
asked Apr 21, 2016 in Computer Networks jothee 10.6k views
...