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
- 8713 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
Tell me which cable called roll-over?
What cable called v.35?
Tell me which protocol comes under hybrid dynamic type?
When configuring a router utilizing both physical and logical interfaces, what factor must be considered in determining the OSPF router ID?
Tell us the name of best path in eigrp protocol?
Which LAN switching method is used in CISCO Catalyst 5000?
Tell me when we use extended access-list?
Explain how many tables are in ospf protocol?
What is the main advantage of using switches?
Explain the types of ospf configuration?
Explain the term 'unicast'.
How is rip different from igrp?
What is difference between switch & hub?
hi friend i am sending some interview question which is asked from me at volvo hope this will help you of all 1 what is mpls al question is posted by jitendera kumar sinha
what are the different asymmetric algorithms?
