Scribd
Upload
72 views

Link State Routing

Link state routing protocols have each router share information about its connected neighbors with all other routers. Each router builds three tables: one for neighbors, one with the full network topology, and one for routing. Routers flood the network with link state advertisements when neighbor connections change. Routers then use Dijkstra's algorithm on the shared topology to independently calculate the shortest paths to all destinations.

Uploaded by

Pav Technicals
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
72 views

Link State Routing

Link state routing protocols have each router share information about its connected neighbors with all other routers. Each router builds three tables: one for neighbors, one with the full network topology, and one for routing. Routers flood the network with link state advertisements when neighbor connections change. Routers then use Dijkstra's algorithm on the shared topology to independently calculate the shortest paths to all destinations.

Uploaded by

Pav Technicals
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Link State Routing

Link State Routing


• Protocols that use link state routing have a complete picture of
the network topology.
• As a result, they have a better understanding of the entire network than
any distance vector protocol.
• Each router with link state routing creates three separate tables:
• One table stores information about directly connected neighbours,
• another stores the topology of the entire internetwork,
• and the third stores the actual routing table.
Link State Routing
• It is a dynamic routing algorithm in which each router in the
network shares information about its neighbours with all other
routers.
• Through flooding, a router sends information about its
neighbours to all other routers.
• Information sharing happens only when there is a change.
• Dijkstra’s Algorithm helps in creating routing tables.
Link State Routing
• Link State Routing executes the following steps in its operation:
• Discovery
• Link Cost
• Link State Packets
• Shortest Path
Link State Routing: Discovery
• Each Link State enabled router sends a HELLO message on each
of its links on a regular basis.
• Neighbour routers identify themselves in response to these
HELLO messages.
• The HELLO initiator uses the network addresses of the routers
to build up its neighbour table, which are attached to the replies.
Link State Routing: Link Cost
• Each router is subjected to a series of tests in order to determine
the cost to each of its neighbours.
• End-to-end delay, throughput, or a combination of these metrics could
be used to calculate the cost.
• The important thing to remember is that every link state
enabled router must have a cost estimate for each of its links.
Link State Routing: Link State Packets
• Each router creates a packet containing its neighbours as well as
the link costs associated with these neighbours.
• Each router adds its identity, a sequence number, and an age
parameter to the beginning of the packet, the latter being used
to ensure that no packet wanders around for an indefinite
period of time.
• The packet floods into the network after the construction
process is completed.
Link State Routing: Shortest Path
• A router can then use the Dijkstra algorithm to compute the
shortest path to any given destination using all of the details
from its link state table.
Problems of Link State Routing:
• Heavy traffic due to packet flooding.
• Flooding causes infinite looping, and the Time to Live (TTL)
field solves this problem.
Key Properties of Link State Routing
• Knowledge of the neighbourhood:
• Rather than sending its routing table, a router only sends information about
its immediate surroundings. To other routers, a router broadcasts its identity
and the cost of directly attached links.
• Flooding:
• Every router on the internetwork sends information to every other router
except its neighbours. Flooding is the term for this process. Each router that
receives a packet copies it and sends it to all of its neighbours. Finally, a copy
of the same information is sent to each router.
• Information sharing:
• A router only sends information to all other routers when the information
changes.
Two Phases of Link State Routing:
• Reliable Flooding:
• Initial State: Each node is aware of the costs of its neighbours.
• Final state: Each node has a complete understanding of the graph.
• Route Calculation:
• Dijkstra’s algorithm, also known as the Link state routing algorithm,
finds the shortest path from one node to all other nodes in the network.
• The Dijkstra’s algorithm is iterative, and it has the property that after k
iterations, the least cost paths for k destination nodes are well known.

You might also like