Then routes become unreachable. The balanced hybrid routing protocol uses distance vectors with more accurate metrics to determine the best paths to destination networks. However, it differs from most distance vector protocols by using topology changes to trigger routing database updates. The balanced hybrid routing type converges more rapidly, like the link-state protocols. However, it differs from these protocols by using fewer resources such as bandwidth, memory, and processor overhead.
Static routes take precedence over routes chosen by dymanic routing protocols.
Routing algorithm that iterates on length of path to determine a shortest-path spanning tree. Commonly used in link-state routing algorithms. Sometimes called Dijkstra's algorithm. See also link-state algorithm. Dynamic routing tends to reveal everything known about an internetwork.