Question: M1. Distance Vector algorithms (a)can be based on the Bellman Ford equation (b)do not require the router to have a complete knowledge of the network

M1. Distance Vector algorithms (a)can be based on the Bellman Ford equation (b)do not require the router to have a complete knowledge of the network topology (c) have a deterministic convergence time (d)may be subject to the Count to Infinity
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
