Question: What is the count to infinity problem in distance vector routing? Group of answer choices It takes a long time to converge when there is
What is the "count to infinity" problem in distance vector routing?
Group of answer choices
It takes a long time to converge when there is a link cost increase.
It takes a long time to converse when the link cost decreases.
The algorithm oscillates when there is a link cost increases.
The algorithm oscillates when there is a link cost decrease.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
