Dynamic & Static Tables Continued
Dynamic routers can use different methods to determine the best path across the network.
One method is distance-vector algorithm, which takes into consideration the number of hops between two points.
A hop is a transition from one network segment to another so each router along a network path is considered one hop. The packet takes the path with the smallest number of hops.
A second method used in dynamic routing is link-state algorithm. Using the link-state algorithm, the router takes into consideration network traffic, connection speed, and other assigned costs.