Distance vector-based routing algorithms (also called as Bellman-Ford algorithms) pass periodic copies of a routing table from router to router. Regular updates among routers communicate topology changes. Every router receives a routing table from its direct neighbour and increases all learned routes by one. By this method, every router learns the internetwork topology by second hand information.