Distance-Vector Routing Algorithm
What is the primary function of the Distance Vector (DV) routing algorithm?
Which of the following describes a key characteristic of the Distance Vector algorithm?
What information does a node send to its neighbors during the DV update process?
What is the purpose of the Bellman-Ford equation in the context of DV routing?
In the Bellman-Ford equation, `Dₓ(y) = minᵥ {c(x, v) + Dᵥ(y)}`, what does `c(x, v)` represent?