|
Routing
algorithm in which each router broadcasts or multicasts information regarding
the cost of reaching each of its neighbors to all nodes in the internetwork.
Link state algorithms create a consistent view of the network and are therefore
not prone to routing loops, but they achieve this at the cost of relatively
greater computational difficulty and more widespread traffic (compared with
distance vector routing algorithms). Compare with distance vector routing
algorithm. See also Dijkstra's algorithm.
|