From Traveler's Dilemma to Dynamic Routing | Demystifying Networking

The distance vector routing algorithm is a fundamental Internet routing protocol where routers periodically exchange their routing tables containing destination addresses and hop counts, enabling all routers to learn how to reach any network destination; however, this approach has limitations when network links frequently fail and recover, as it requires propagating routing updates throughout the network, making it more suitable for stable, small-scale networks.