Scribd
Upload
10 views

5.2 OSPF State

Ospf states

Uploaded by

Bhawesh Banaula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

5.2 OSPF State

Ospf states

Uploaded by

Bhawesh Banaula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

OSPF state

1 Down
 No hello will be sent or received because interface is down.
 This is the initial state of a neighbour relationship. It indicates that the
router has not received any ospf hello packets.
2 Init
 Hello is sent.
 This state indicates that a hello packet has been received from
another router, but bidirectional communication has not been
established.
 Active neighbour ship

3 2-way
 Hello is sent and received.
 Neighbour ship is done.
 Bidirectional communication has been established. If a DR or BDR is
needed, the election occurs during this state.
4 Exstart
This is the first state in forming an adjacency
Null DBD is exchanged between to verify bidirectional connectivity
for updates.
 Routers identify which router will be the master or slave for the LSDB
synchronization.
 Master/Slaves (Election)
 Highest RID
 To decide who will start sending the database first
 Once the election will be completed they will move to “ exchange”
state
 Seq number
 Master sequence number will be used to share DBD.
 Only master will increase Seq number
 MTU size negotiate
 Init = 1
 More = 1
 Master = 1

5 Exchange
 During the state, routers are exchanging link states by using DBD
packets.
 Asking about each other’s database.

6 Loading
 Slave will send LSR to ask detail information about LSA Header.
 Master will send LSU
 Slave will send LSACK
 When the database is completely synchronised they will move to full
state and will said to form “adjacency”
 Neighbour ship / adjacency -> 40 sec (wait timer )

2 –Way State
 Network type
1 BMA (Broadcast Multi Access)
2 P2P (Point to point)
 Number of Neighbour ship = n (n-1)/2 n= Number of router
 To reduce the number of adjacencies, router will elect DR & BDR between the router
o DR(Designated Router)
o BDR(Backup Designated Router)
Election Criteria
o HIGHEST Priority (def=1) = 0 -255
o Highest RID

One broadcast domain can have only one DR and one BDR
o Every DRother will form adjacency with DR and BDR both.
o DR and BDR will form adjacency with each other.
o DRother will never form adjacency with DRother.
 224.0.0.5  Whenever DR send any update all will received from this multicast add. Every
router of ospf can accept that.
 224.0.0.6Only DR and BDR can accept the update.
 Clear IP OSPF PROCESS (Y)  Simultaneously with in msec
1 DR (only two router in one BMA) currently
2 DR/BDR (when more than two router in BMA)

No election takes place of DR and BDR on P2p Segment.

Debug ip ospf packets


Debug ip ospf events
Debug ip ospf ajd..

You might also like