Question: To create a least-cost tree for itself, using the shared link-state database, each node needs to run what? A)distance-vector B)Dijkstra algorithm C)two node loop D)border
To create a least-cost tree for itself, using the shared link-state database, each node needs to run what?
A)distance-vector B)Dijkstra algorithm C)two node loop D)border gate protocol
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
