Link-state routing protocol: Difference between revisions

Revision as of 10:38, 9 March 2005

Revision as of 12:44, 14 March 2005

Line 5:

Each node then independently calculates the best ''next hop'' from it for every possible destination in the network. (It does this using only its local copy of the map, and without communicating in any other way with any other node.) The collection of best next hops forms the [[routing table]] for the node.

This contrasts with [[distance-vector routing protocol]]s, which work by having each node share its '''routing table''' with its neighbors,. In a link-state protocol, the only information passed between the nodes is information used to construct the connectivity maps.

==History==