Distance-Vector Routing Algorithm
What is the primary goal of the Distance Vector Routing Algorithm?
Which type of information does each node maintain in Distance Vector Routing?
How do nodes exchange routing information in Distance Vector Routing?
Which mathematical equation is used to update a node's distance vector?
What happens when a node updates its distance vector?