IP Routing Protocols

DISTANCE-VECTOR (MINIMUM HOP) PROTOCOLS

Distance-vector protocols use distributed computation, which means each router calculates its “best”path to a destination separately from other routers. Each router notifies its neighbors of its known best path, and at the same time, these routers also notify their neighbors of their knowledge of the best path.

So, a router obtains information from its neighbors, which may reveal a better path to a destination. In this case, the router updates its table, and also notifies its neighbors of its new choice. This process is iterative, and continues until the routes in the routing domain stabilize.

Distance-vector protocols are simple to install, maintain, and troubleshoot. They support address aggregation, ...