19 - OSPF - CBT CCNP VID 10 - STATES Flashcards

1
Q

((Down State))

After starting the OSPF process on the router,

A

(first step)
It chooses the router ID. Router ID is the router Name in OSPF.
It is how routers using ospf identifies each other.
* By default they way the router chooses its name is
- Highest active Interface Ip address when OSPF starts

Hierarchy Router prioritises when choosing the Ospf ID:

  • Manually entering the router ID
  • Highest Loopback interface Ip address
  • Highest Physical interface Ip address

(second step)
After adding the interfaces with the relavent ip addresses using the network command,
these will be added into the Link state Database.

( only with devies within the same OSPF area )

(third step)

  • Sends hello messages on chosen interfaces
  • once in every 10 seconds on broadcast & point to point networks
  • once in every 30 seconds on NBMA network
  • dead Timer is 4 times the hello timer. 10sec x 4 = 40 & 30sec x 4 = 2mins

All the above hello timers & dead timers can be tweaked to make it faster

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

((Init state))

(STEP FOUR)
After sending a multicast hello message - It receives a unicast hello message from a router that want to become a neighbour

A
  • This is why this stage is called the initialisation stage - officially known as the ‘init state’
  • In this init state the router checks to make sure neighbour details below are the same or it wont add each other as a neighbour
  • If the details do not match it will repeatedly go from “init state” to “Down state” - back and forth

These details in the hello message must be the same

  • Hello & dead Timers
  • Network Mask
  • Area ID
  • Authentication password
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

((two way state))

(step five)
- am I listed as a neighbour in your hellos packet ?

A

-if yes - reset the dead timer
-if no - add as a new neighbour
Formed a neighbour relationship
They are formally in each others database as neighbours

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

((Exstart state))

(Step six)

A

(Step six)
Let’s Start the exchange of each other’s database.
-But before we do let decide who the master to go first.
-Master - highest router priority decide who is the master.
-If the router priority is a tie the highest Ospf router ID breaks the tie

-Master then sends database description packet (DBD).
A Summed up version of network routes, coz it might already know them.

  • slave then sends it’s (DBD) (via reliable connection)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

((Loading state))

Step seven

A
((Loading state))
(Step seven)
-DBDs are acknowledged and reviewed. 
- if routes are not know they will be requested, by Slave first
- slave will request first ( LSR )
- master send updates  ( LSU )
- master request details ( LSR )
- slave send updates ( LSU )
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

((Full state))

A

(Step eight)

  • when router finished sending routes and both devices have the exact same link state database (DBD) (routing table)
  • neighbours are fully synchronised !

Now the router runs the DIJKSTRA SPF algorithm to figure out what to do with all this Data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly