Scribd
Upload
10 views

OSPF

OSPF divides a network into multiple areas with area 0 being the backbone area. It uses the Dijkstra algorithm to calculate the shortest path first from a link state database which contains neighbor relationships and network topology information exchanged between routers using link state advertisements.

Uploaded by

Charmae Merca
Copyright
© Attribution Non-Commercial (BY-NC)
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

OSPF

OSPF divides a network into multiple areas with area 0 being the backbone area. It uses the Dijkstra algorithm to calculate the shortest path first from a link state database which contains neighbor relationships and network topology information exchanged between routers using link state advertisements.

Uploaded by

Charmae Merca
Copyright
© Attribution Non-Commercial (BY-NC)
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 2 types of Link-state routing protocols: 1. IS-IS 2. OSPF first Link-state maintain 3 tables 1.

Neighbor same as eigrp directly connected neighbors 2. Topology knows the road map for the entire area 3. Routing Distance vector protocol (bgp, eigrp, etc) - Topology table is list of the neighbors have passed on routing by rumor protocol a router only knows what the other routers know Link-state protocol It uses Dijkstra s shortest path first (SPF) algorithm Sends triggered updates to announce network changes Sends periodic updates (Link-State refresh) on long intervals

Ospf divides the network to multiple areas. All areas must connect to area 0 (backbone area) All routers in an area have the same topology table Goal: localize updates within an area Requires a hierarchical design hierarchy of ip address schemes. Area border router (ABR)- a router connecting between different areas Autonomous System Boundary Router router which connects all networks to the outside network ABR and ASBR the only routers in ospf that has the ability to do summarization

Understanding ospf neighbor relationships 1. Determine your own Router ID Router ID-the router s name (an IP address) in OSPF process Highest active interface IP Add when OSPF starts (loopbacks beat physical interfaces) 2. Add interfaces to the link state database (dictated by the network command) 3. Send a hello message on chosen interface(s) -once every 10 sec on broadcast or P2P networks -once every 30sec on NBMA networks Can be tuned depending on the BW -contains all sorts of information: 1. Router ID 2. Hello and Dead timers* dead timer is four times the hello timer There are 4 hellos before the network knows the neighbor is down 3. Network mask* 4. Area ID* 5. Neighbors 6. Router priority 7. DR/BDR ip address 8. Authentication password* With *, needs to be equal/same among neighbors 4. Receive Hello INIT state- the router receives the Hello but doesn t really mean that they are neighbors yet. It still has to : -check hello/dead interval -check netmasks -check area ID -check authentication passwords If failed, the router will be in down state. 5. Send reply Hello Am I listed as a neighbor in your Hello packet? If yes, reset dead timer If no, add as new neighbor 6. Master-Slave relationship determined- Exchange start (exstart) State - Determined by priority , router-ID breaks tie (the higher router-ID wins) - Master sends database description (DBD) packet DBD = cliff notes of link-state database - Slave sends its DBD packet 7. DBDs are acknowledges and received Loading State - Slave requests details (link state requests LSR) - Master sends updates (link state updates LSU) - Master requests details (LSR) - Slave sends updates (LSU) 8. Neighbors are synchronized Full state

>>show ospf neighbor shows all neighbors Now, it s time to run the Dijkstra SPF algorithm to figure out what to do with all this data

You might also like