to infinity. This means that there is no hop count limit. A link-state routing

protocol works on the theory that routers send out a link state, which carries

information about each interface and the nodes attached.

rithm, which was developed by Edgar Dijkstra. This theory is used to

construct a loop-free subset of the network topology using bits of informa-

tion contained in each link-state message to create a directed graph where

each link is represented by vertices and weighted edges, as shown in Figure

7.6. Each link represents a cost.

culated, each link in the path has a given value, and the total of the values to

a given point or destination is the total weighted value of the path. The low-

est total weighted value represents the most efficient path from one point to

another point.

tocols also differ from distance-vector protocols because of their procedure

for route calculation and advertisement. This procedure enables link-state

routing protocols to scale well with the growth of a network.