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
- 8802 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 do you mean by Port Mirroring?
When configuring a router utilizing both physical and logical interfaces, what factor must be considered in determining the OSPF router ID?
What is the passive topology in ccna?
Explain what is eigrp?
What are the possible ways of data exchange in ccna?
2500 Value in which type of access list?
How many collision domains are in switch?
Explain the benefits of vlan?
Why we use debug command?
What are the two types of transmission technology use in ccna?
Hub in star topology or bus topology?
When we use extended access-list?
Which cable called roll-over?
What is default time of hello packets in ospf?
What is difference between switch & hub?
