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
- 7740 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
What is the network subnet?
Explain what is the default behavior of access-list?
Can you explain PPP protocol?
When does network congestion occurs?
In eigrp metric parameters which 2 options are enable by default?
How is private ip different from public ip?
What is the Difference Between Windows 2003 And Windows 2008 Server?
Define the multicast routing?
Why is distributed processing useful?
What do we check while configuring the server?
Why we use filter option?
Which protocols are link states?
What are the two types of transmission technology use in ccna?
What is trigger rip and from which ios version it starts?
Why ip address called logical address?
