Link State Routing
Link State Routing
ROUTING
K AV YA S H R E E N
CONTENTS
INTRODUCTION
LINK STATE ROUTING
FEATURES OF LINK STATE ROUTING PROTOCOLS
LINK STATE PACKET
LINK STATE DATABASE
SHORTEST PATH FIRST ALGORITHM
LEAST COST TREE
ROUTING TABLE
OSPF
CASE STUDY
INTRODUCTION
Unicast – Unicast means the transmission from a single sender to a single receiver.
It is a point to point communication between sender and receiver. There are various
unicast protocols such as TCP, HTTP, etc.
3 4 4 G
1
D 5
E 2
F
Link
Node Cost Node Cost
Node Cost
A 2 B 5
B 2
C 5 F 4
D 3
E 4 G 3
A B C 3
2 5
Node Cost
3 4 4 G C 3
F 1
1
D 5
E 2
F
Node Cost Node Cost Node Cost
A 3 B 4 C 4
E 5 D 5 E 2
F 2 G 1
LINK STATE DATABASE
A B C D E F G
A 0 2 - 3 - - -
B 2 0 5 - 4 - -
C - 5 0 - - 4 3
D 3 - - 0 5 - -
E - 4 - 5 0 2 -
F - - 4 - 2 0 1
G - - 3 - - 1 0
Shortest path first algorithm (Dijkstra algorithm)
Start
Tentative Yes
list is Stop
empty
NO
Among nodes in tentative list, move the one with the shortest path to
permanent list.
Add each unprocessed neighbour of last moved node to tentative list if not already there.
If neighbour is in the tentative list with larger cumulative cost, replace it with new one.
LEAST COST TREE
2 2 7
0 0
A B C A B C
G G
D E F D E F
3 6
3
2 7
2 7
0 A B C 0 A B C
G 9
G
D E F
D E F
3 6 8 3 6 8
ROUTING TABLE FOR A
NODE COST
2 7 A 0
0 A B C B 2
G C 7
D E F D 3
3 6 8 E 6
F 8
G 9
Advantages of Link State Routing
Link-state protocols use cost metrics to choose paths through the network.
Routers use the latest information to make the best routing decisions.
The link-state database sizes can be minimized with careful network design.
Disadvantages of link-state routing
They require more memory and processor power than distance vector
protocols.