1 CBT ccnp version ospf

OSPF - CBT CCNP VID 9

Routing protocol all have

=========================
- neighbour table

- topology table

- routing table

Topology tables
---------------
EIGRP Topology
- knows only the routes connected to it, 1st route & 2nd best route

Ospf topology
- know the topology of the whole network in its area

Ospf updates topology

- triggered updates (announce to whole network)
- send periodic updates (link state refresh, LSF) once in every 30sec

Area.
-----

Abr= area boarder router

- restricts triggered updates to its own area

- this prevent topology calculation on every router in every areas
- this requires ip hierarchy (sometimes location too)

Asbr= autonomous system boundary router

- Outside of OSPF system, e.g EIGRP,BGP etc

Summarisation
- only in abr & asbr

((Down State))
==============
After starting the OSPF process on the router,

(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
Router id is important because
- is used To configure Ospf
- if Router interface are added or remove, all config using previous router iD is
useless, as the ID has just changed. This is why hardcoding the router iD is
important.

Router ID only changes if:

- ospf process is restarted
- router is restarted

E.g if Ospf ID is not hardcoded, then if the router reboots weeks later, the
neighbour relationship breaks!

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

Neighbour process.
-------------------
( only with devies within the same OSPF area )

(third step)
*Sends hellow 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 hellow timer. 10sec x 4 = 40 & 30sec x 4 = 2mins

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

Whats inside the hellow message ?

Hellow message is like profile with all its OSPF details

- Hellow & dead Timers

- Network Mask
- Area ID
- Authentication pasword

THE ABOVE ALL HAVE TO BE THE SAME ON BOTH ROUTER THAT ARE TRYING TO FORM A NIEGHBOR
RELATIONSHIP

- Router ID
- DR/BDR ip address
- router priority
- Neighbors

((Init state))
==============
(STEP FOUR)
After sending a multicast hellow message - It receives a unicast hellow message
from a router that want to become a neighbor
- how do we know its a knew neighbour and not an exisiting one ? It does not have
this router in its nieghbor table & it respond via unicast message
- 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 nieghbor details below are the
same or it wont add each other as a neighbor
- If the details do not match it will repeatedly go from "init state" to "Down
state" - back and forth

These details in the hellow message must be the same

----------------------------------------------------
- Hellow & dead Timers
- Network Mask
- Area ID
- Authentication pasword

((two way state))

=================
(step five)
- am I listed as a neighbour in your hellos packet ?
-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

((Exstart state))
===========
(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) (reliable connection)

((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 )

((Full state))
========
(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.

Video finished !

Summary
- concept compared of topology
- area design & Abr/asbr
- Ospf neighbour relationship steps

Sent from my iPhone