The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem:
S1 : The count-to-infinity problem may arise in distance vector routing protocol, when network gets disconnected.
S2 : The count to infinity problem may arise in a distance vector routing protocol even when the network never gets disconnected.
S3 : The “path vector” enhancement to a distance vector routing protocol always enables the protocol to converge without count to infinity.
Which of the following is correct?

(A) Only S1 AND S3

(B) Only S2 AND S3

(C) Only S2

(D) All of them

asked in Computer Networks by (143 points) | 131 views

1 Answer

0 votes

Option (A) Only S1 AND S3

answered by (27 points)

Related questions

+2 votes
1 answer
asked Jul 19, 2016 in Algorithms by dileswar sahu Active (1.9k points) | 211 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

46,668 questions
51,139 answers
66,556 users