L I N K S TAT E

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.

There are three major protocols for unicast routing:

1. Distance Vector Routing

2. Link State Routing
3. Path-Vector Routing
 Link State Routing

Link state routing is the second family of routing protocols. While

distance vector routers use a distributed algorithm to compute their
routing tables, link-state routing uses link-state routers to exchange
messages that allow each router to learn the entire network topology.
Based on this learned topology, each router is then able to compute its
routing table by using a shortest path computation.
Features of link state routing protocols –

 Link state packet – A small packet that contains routing

information.
 Link state database – A collection of information
gathered from link state packet.
 Shortest path first algorithm (Dijkstra algorithm) –
A calculation performed on the database results into
shortest path
 Routing table – A list of known paths and interfaces.
 LINK STATE PACKET

 Identity of the node and the cost of the link. The

combination of these two pieces of information is called
the Link State Packet.

After a node has prepared an LSP, it must be disseminated

to all other nodes, not only to its neighbours. This process
is called flooding.
Node
Cost
2 5
A B C 3

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

Set root to local node and move it to tentative

list.

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.

 Each router has a complete and synchronized picture of 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.

 They require strict hierarchical network design.

 They require an administrator who understands the protocols well.

 Open Shortest Path First

Open Shortest Path First (OSPF) is a routing protocol for Internet

Protocol (IP) networks.
It uses a link state routing (LSR) algorithm and falls into the group of
interior gateway protocols (IGPs), operating within a single autonomous
system (AS).

OSPF is a widely used IGP in large enterprise networks.

Open shortest path first (OSPF) routing
protocol –
1.Open Shortest Path First (OSPF) is a unicast routing protocol developed
by working group of the Internet Engineering Task Force (IETF).
2.It is a intradomain routing protocol.
3.It is an open source protocol.
4.It is similar to Routing Information Protocol (RIP).
5.OSPF is a classless routing protocol.
6.OSPF is implemented as a program in the network layer using the
services provided by the Internet Protocol.
7.OSPF is based on the SPF algorithm, which sometimes is referred to as
the Dijkstra algorithm.
 OSPF Messages

1. Hello message (Type 1)

2. Database description message (Type 2)

3. Link-state request message (Type 3)

4. Link-state update message (Type 4)

5. Link-state acknowledgement message (Type 5)

 CASE STUDY
ARPANET
ARPANET: FIRST GENERATION VECTOR ROUTING

 Based on Distance vector routing(1969).

 Distributed adaptive algorithm using delay as the performance criterion.
 The estimated link delay is simply the queue length for that link.
 In building the new routing table, a node will tend to favour outgoing links
with shorter queues.
 Since queue lengths vary rapidly with time, a thrashing situation may result.

Drawbacks of the first generation algorithm:

 Only queue lengths were considered, and not line speed.

 Queue length is only an artificial measure of delay.
 ARPANET: SECOND GENERATION

 New algorithm was proposed in 1979, based on link state routing.

 A distributed adaptive algorithm, using actual delay as the
performance criterion
 The delay is measured directly, by time stamping the packets using the
positive ACK.

APARNET : THIRD GENERATION

 Problem with the previous approaches was that every node

was trying to obtain the best route for all destinations, and
that efforts conflicted.
 CONCLUSION

It was concluded that under heavy loads, the goal

of routing should be to give the average route a
good path instead of attempting to give all routes
the best path.
THANK YOU