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.
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
Explain why is udp lease favored when compared to tcp?
What are segments?
How many ways are there to implement VPN architecture?
which defined peer ip address an local subnet belong to crete? (Choose two)
Can you describe the Authentication Header (AH) Protocol?
Tell me why we use filter option?
Explain the difference between flsm and vlsm?
Mention what is dhcp?
What is difference between rip and ripv2?
What is the difference between csma/cd and csma/ca?
Frame relay technology works on which layer of osi model?
Utilizing RIP, what is the limit when it comes to the number of hops?
Tell me how many fillers we can put in one ip of ipv6?
What is the frame relay, in which layer it comes?
What is the difference between switch, routers, and hub?