Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 8836 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
Mention what is bootp?
Mention what BOOTP is?
How does PPP use LCP for link control?
What is the minimum request timer?
Define routing?
Explain why is udp lease favored when compared to tcp?
what does the clock rate do?
Which LAN switching method is used in CISCO Catalyst 5000?
What is the command use to add a banner to a cisco router configuration?
Why is vlan used?
Explain how many maximum paths you can give on latest ios in rip?
which defined peer ip address an local subnet belong to crete? (Choose two)
How many types of ospf configuration?
If there is only 2 host in bus topology is that possible collision accord?
What is the difference between switch, routers, and hub?
