How the route maintenance will be going if the route between node g and node j is broken?
Answers
Distance Vector Routing Protocols
Distance vector routing protocols represent some of the oldest routing protocols still in use today. They, for the most part, are easy to understand. They use an algorithm called the Bellman–Ford to determine the preferred network path for transmission. The Bellman–Ford algorithm will help determine which network path is the shortest and most preferred route to a destination.
Routers using distance vector routing protocols will share routing informationwith other routers on the network. Distance vector routing protocols transmit their entire routing tables to all their directly connected neighbors. They are considered somewhat inefficient because these updates are periodically sent regardless of the network state, whether there are updates to the network topology or not.