Link State Routing Link State Routing Link State Routing Link State Routing
Uploaded by
yesmuraliLink State Routing Link State Routing Link State Routing Link State Routing
Uploaded by
yesmuraliLINK STATE ROUTING Each router does the following (repeatedly):
discover neighbors, particularly, learn their network
Link state broadcast – node learns about the path costs from its addresses
neighbors A router learns about its neighbours by sending a special
Inform the neighbors whenever the link cost changes HELLO packet to each point-to-point line. Routers on the other
end send a reply.
hence the name link state
measure the cost to each neighbor
e.g. by exchanging a series of packets
sending ECHO packets and measuring the average round-trip-
time
construct a link state packets
send this packet to all other routers by “flooding”
compute locally the shortest path to every other router
when this information is received
Information will be shared when there is a change.
Concept of Link State Routing
Cost in Link State Routing
39 40
Link State Packet
Link State Database
Flooding of A’s LSP
41 42
The Dijkstra Algorithm Shortest Path Tree
All the routers applies this algorithm to its link state database for Dijkstra algorithm follows the following four steps what is
called the shortest path tree(routing table) for each router:
finding the shortest path between two points on a network using a
The algorithm begins to build the tree by identifying its root. The
graph made up of nodes and arcs. root of each router’s tree is the router itself. The algorithm then
Nodes are of two types : networks and routers. attaches all nodes that can be reached from that root(neighbor
Arcs are connections between a router and a network(router to nodes).
The algorithm compares the tree’s temporary arcs and identifies
network and network to router)
the arc with the lowest cumulative cost. This arc and node to
Cost is applied only to the arc from router to network. which it connects are now a permanent part of the shortest path
The cost of the arc from network to router is always zero. tree.
The algorithm examines the database and identifies every node
that can be reached from its chosen node.
The last two steps are repeated until every node in the network
has become a permanent part of the tree
43 44
Example of formation of shortest path tree
45 46
Step 1 Step 2 Step 3
Contd….
47 48
Step 5 Step 4
!
Step 6 Step 7 Step 10 Step 11
Contd…
Step 9 50 Step 13
Step 8 Step 12
Link State Routing table for Router A
51
"
