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.
- 2 Answers
- 7970 Views
- I also Faced
- E-Mail Answers
Answer Posted / guest
Answer: A
The most direct solution to the count to infinity problem is
to lower
what infinity is.
For RIP, the default maximum number of hops is 16. It takes
a lot less
time to count to 16 than infinity.
| Is This Answer Correct ? | 6 Yes | 2 No |
Post New Answer View All Answers
Why we used Virtual MAC in GLBP
What does routing mean?
What is formula of hold down time of eigrp protocol?
What is the command use to add a banner to a cisco router configuration?
How many valid ip will b in /21 in route summarization?
Mention what is the difference between dynamic ip and static ip addressing?
Which protocols are link states?
On which layer does L2F, PPTP and L2TP operate?
After how long keep alive messages exchange in eigrp?
What is cam?
What is default packet size of ipv6?
Which ipsec rule is used for the olympia branch and what does it define?
What is the utility of ping?
On which mode we give debug command?
Value in which type of access list?
