Concept of Link State Routing

1
Concept of Link State Routing
2
Costs in Link State Routing
3
Link State Packet
4
Flooding of As LSP
5
Flooding of Bs LSP
6
Link State Database
7
Finding the Shortest Path

• Select a node (A) and make it permanent
• Examine each of the adjacent nodes to A.
• Relabel each one with the distance to A.
• Make the one with the smallest label permanent.
  (14)
• This becomes the new working node.

8
Costs in Dijkstra Algorithm
9
Shortest Path Calculation
10
Shortest Path Calculation
11
Shortest Path Calculation
12
Shortest Path Calculation
13
Shortest Path Calculation
14
Shortest Path Calculation
15
Shortest Path Calculation
16
Shortest Path Calculation
17
Shortest Path Calculation
18
Shortest Path Calculation
19
Shortest Path Calculation
20
Shortest Path Calculation
21
Shortest Path Calculation
22
Link State Routing Table for A