Link State Routing

Link-State Routing

•       Each node in the domain has the entire topology of the domain.

•        The node can use Dijkstra’s algorithm to build a routing table.

•       The entire topology of the domain would mean-

    a) the list of the nodes and links

    b) how the links are connected

    c) type of the link

    d) cost (metric) of the link

    e) condition of the link (up or down)

•       The topology must be dynamic, representing the latest state of each node and each link.

•        If there are any changes in any point in the network, the topology   must be updated for each node.

•        Though we say that in Link state routing each node has the entire knowledge about the topology, but  basically global knowledge   about the topology is not clear.

•        Here each node has partial knowledge: knows the state of its link

•        The whole topology can be compiled based on the partial knowledge  of  each node.