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 what is overlaod?
What is the igp (interior gateway protocol)?
When does network congestion occurs?
What is difference between flsm and vlsm?
What is ping used for?
Which decision called socket base?
What is the key advantage of using switches?
What is the difference between the communication and transmission?
What is difference between baseband and broadband transmission in ccna?
Why is network segmentation a good idea when managing a large network?
What is raid in ccna?
What is the name of best path in eigrp protocol?
what is the difference between a ‘half-duplex’ and a ‘full-duplex’ system?
On which layer does L2F, PPTP and L2TP operate?
What is default time of hello packets in ospf?