The shortest way to reach the goal

route from the source router to the destination router is to find the least cost between the two. - In other words, the source router chooses a route to the destination router in such a way that the total cost for the route is the least cost among all possible routes. 7-2 ROUTING ALGORITHMS - Several routing algorithms have been designed in the past. - The differences between these methods are in the way they interpret the least cost and the way they create the least-cost tree for each node. - Distance-Vector Routing - Link-State Routing Distance-Vector Routing The first thing each node creates is its own least-cost tree with its immediate neighbors. The incomplete trees are exchanged between immediate neighbors to make the trees more and more complete