Link-state routing protocol: Difference between revisions

Revision as of 14:20, 21 November 2022

Revision as of 14:24, 21 November 2022

Line 2:

{{More footnotes needed|date=September 2010}}

'''Link-state routing protocols''' are one of the threetwo main classes of [[routing protocol]]s used in [[packet switching]] networks for [[computer communication]]s, the others being [[distance-vector routing protocol]]s and [[path-vector routing protocol]]s. Examples of link-state routing protocols include [[Open Shortest Path First]] (OSPF) and [[Intermediate System to Intermediate System]] (IS-IS).

The link-state protocol is performed by every ''switching node'' in the network (i.e., nodes that are prepared to forward packets; in the [[Internet]], these are called [[Router (computing)|router]]s). The basic concept of link-state routing is that every node constructs a ''map'' of the connectivity to the network, in the form of a [[graph theory|graph]], showing which nodes are connected to which other nodes. Each node then independently calculates the next best logical ''path'' from it to every possible destination in the network. Each collection of best paths will then form each node's [[routing table]].