Distance vector routing is a routing algorithm where each router maintains a routing table with the best routes to other routers in the network. The tables are dynamically updated as routers exchange information with their neighbors about changes in route distances. Each router knows the optimal path to every other router by keeping track of the next hop and distance to each destination router based on information from neighbors.