m INTRODUCTION

m OSPF

m ROUTE CALCULATION

m OSPF PROTOCOL
V Packets are to be sent from source to
destination via ports.

V Selection of ports are done by two ways

1)Forwarding
2)Routing
V Forwarding : Selecting ports through
forwarding table

V Routing : Method of designing the

forwarding table

V Routing tables are built through several

routing algorithms
V Networks are represented as graphs
as follows
V Routing protocol

V Each node is assumed to be capable of finding

its neighbors and also the costs

V Based on two mechanisms

1) Reliable dissemination
2) Calculation of routes
V Phenomenon by which every node in the graph gets a
copy of the link-state information of other nodes.

V This is done by creating a packet called Link State

Packet (LSP).

V LSP contains the following information

* ID of the node that created the LSP
* List of direct neighbors and their respective
costs
* Sequence number
* A time to live for the packet
V New LSP is generated mainly because of two
conditions
1) Expiry of time
2) Disturbance in topography

 Topography check is done by exchange of

´helloµ messages.

 LSP should contain a newly updated information.

 When a new LSP is generated, the sequence number is

incremented by 1.

 If a node goes down and comes back, the sequence

number is initialized 0.
V Dijkstra·s algorithm is used
V Example
V Many features are available in this to make
OSPF still more stronger
V The main features are
1)Authentication of routing messages
2)Additional hierarchy
3)Load balancing
V Authentication of messages- protecting
information from malicious users
V Hierarchy- A general format of the routing
information
V Load balancing-To balance the traffic of routing
V OSPF header format is as follows
V There are several types of messages
1)Hello
2)Request
3)Send
4)Acknowledge
 The building blocks for messages is called
Link-State Advertisement (LSA)
V LSA format