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
- 7737 Views
- I also Faced
- E-Mail Answers
Answer Posted / swapnil gupta
Defining maximum hop count which is by default 16...
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
what are the different symmetric algorithms?
Explain what is the size of hello packets in eigrep protocol?
What are the different types of the password used in securing a cisco router?
What is 10base2 ethernet lans?
Tell me how many fillers we can put in one ip of ipv6?
What is quality of ipv6?
Which LAN switching method is used in CISCO Catalyst 5000?
Utilizing RIP, what is the limit when it comes to the number of hops?
Explain how many tables are in ospf protocol?
Can you explain in a generic manner the packet of IPSec?
What causes a triggered update to reset the router hold-down timer?
What is the function of application layer in networking?
Explain isakmp ?
Which cable called v.35?
In configuring a router, what command must be used if you want to delete the configuration data that is stored in the NVRAM?
