What characterizes Distance Vector routing protocols?

Distance Vector routing protocols are primarily characterized by their method of sharing route information with neighboring routers. They operate by sending periodic updates that contain the entire routing table to directly connected neighbors. This periodic nature can lead to slower convergence times when the network topology changes, as the routers need time to propagate the updated information throughout the entire network.

Convergence refers to the time it takes for the entire network to agree on the best routes after a change occurs. Because Distance Vector protocols rely on broadcasting their routing tables periodically instead of responding immediately to topology changes, it often results in slower updates and longer convergence times compared to more advanced routing protocols like Link-State.

Complex cost calculations are more characteristic of Link-State protocols, which analyze the topology in a detailed manner to determine the best paths. Hence, the option accurately describes the fundamental attributes of Distance Vector routing protocols.