Distance vector routing algorithm is a dynamic routing algorithm. The routing…

Answer: Routing tables in distance vector routing are updated by exchanging information with neighbour nodes.

Explanation: In distance vector routing each router maintains a table of distances (costs) to destinations and periodically shares this distance vector with its immediate neighbours. Routers use information received from neighbours to update their own routing tables.

• Periodic updates: routers send their distance vectors at regular intervals to neighbours.

• Triggered updates: when a route changes (e.g., link failure), routers immediately notify neighbours so updates propagate faster.

• Decentralized operation: there is no central server or backup database used to push updates.

• Convergence issues: distance vector protocols can suffer from the count-to-infinity problem; techniques such as split horizon, route poisoning, and hold-down timers are used to mitigate this.

Contrast: Unlike link-state routing, which floods full topology information to all routers, distance vector routing exchanges only neighbour-to-neighbour distance information.