OPEN SHORTEST PATH FIRST (OSPF)

TEAM MEMBERS
T.Kartheek T.Sindhuri T.V.S.Goutham T.Shankar

 OSPF is an example of link state routing protocol When a network link changes state (up to down, or vice versa), a notification, called a link state advertisement (LSA) is flooded throughout the network. All the routers note the change, and recomputed their routes accordingly. This method is more reliable, easier to debug and less

Router (R1) link is down so the topology changes link state protocols send an update when there is change in the network.

OSPF CONVERGENCE
The equation used to calculate the cost of an OSPF link is Cost = 100,000,000 / bandwidth of link in bps OSPF routers within a single area advertise information about the status of their links to their neighbours. Messages called Link State Advertisements, or LSAs, are used to advertise this status information.

An LSA contains information about neighbours and path costs.

The five different types of OSPF LSPs Hello Data base description (DBD) Link state request (LSR) Link state update (LSU) Link state acknowledgement (LSAck)

 Once an OSPF router receives LSAs describing all of the links within an area, it uses the SPF algorithm, also called Dijkstra's Algorithm, to generate a topological tree, or map of the network.

SPF tree and paths maintained by R4

In this slide keep ospf packet format

In this slide keep ospf areas

Problems with multi access networks

How DR and BDR elections are conducted?

Configuring OSPF in a single area