Distance vector routing
Distance Vector Routing is a type of routing algorithm used in network layer for determining the best path for data transmission. It is also known as Bellman-Ford algorithm or Distributed Bellman-Ford algorithm. In Distance Vector Routing, each router maintains its own routing table and shares information about its own distance to other routers in the …