In distance-vector routing, there is a problem known as the
'count

to infinity' problem. What is the most direct solution to this?

A.) Defining a Maximum.

B.) You can not solve the 'count to infinity' problem with a
distance

vector protocol.

C.) Poison Reverse.

D.) Triggered Updates.

E.) Split Horizon.

Answer Posted / swapnil gupta

Defining maximum hop count which is by default 16...

Is This Answer Correct ?    4 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the difference between bus topology and hub?

766


Differentiate Logical Topology from Physical Topology

813


If line down and protocol also down; in this case which layer move problem?

772


How many types of ips?

772


Can you explain PPP packet format?

1671






What is the difference between full duplex and half duplex?

781


Hub in star topology or bus topology?

780


How do we do encryption and authentication in L2F?

2514


What is the difference between hub, switch, and router?

756


What is the checksum?

744


Which defined peer ip address an local subnet belong to crete?

724


Which command we give if router ios stucked?

724


Which layer are called upper layer?

690


Define the igp (interior gateway protocol)?

717


What is GRE in PPTP?

1773