it will take the highest IP address of interfaces or it

OSPF Open Shortest Path First can be manually configured.

2. Priority: it is the priority of the neighbor
router, the highest priority determines the
Summary designated router (DR) if the priorities are all the
same the designated router will be the one who
History has highest ID. By default routers have priority 1, a
OSPF Principles router with priority 0 never becomes a designated
router or Backup designated router (BDR).
OSPF Concepts & Structure. 3. State: The State field indicates the functional
Neighbor table state of the neighbor router defined in the
RFC2328 in 1998. Down: This is the first OSPF
Topology table neighbor state, it means that no information
Routing table (hellos) has been received from this neighbor, but
OSPF Areas hello packets can still be sent to the neighbor in
this state. Attempt this state is only valid on the
OSPF Packets NBMA environment ATM, Frame Relay and X25.
Area Border routers The router sends unicast hello packets every poll
interval to the neighbor, from which hellos have
Autonomous Boundary router
not been received within the dead interval. Init:
OSPF Operations the state specifies that the hello packet has been
Cisco OSPF Basic commands received from the neighbor but the neighbor
router ID was not included to be considered as a
History: valid Hello Packet. 2-Way: this state means that
Based on Djikstra Algorithm the Hello Message has been successfully passed in
Released in 1989 V1 RFC1131 the bi-directional ways; this state is attained just
Released in 1991 V2 RFC1247 when the router sees its own ID in the hello packet
V2 Updated on 1998 RFC2328 of its neighbor. Exstart: at this stage routers
Released in 1999 V3 RFC2740 establish a master and slave relationship to start
OSPF principles: exchange the link state information. The
OSPF is link state based protocol designated router DR and BDR are the only who
Aims to get the best route can increment the sequence number.
Get the sonnest possible the optimal routing Exchange: in this state the routers exchange (DBD)
table. database descriptors packets; the DBD Packets
Note: contains link-state advertisement headers (LSA).
1. Best & Optimal depend on the used metric Loading: in this state, the actual link state
2. Metric = Cost is calculated based on the information occurs based on the information
following rule : provided in the DBD; routers send link-state
Cost = (108 / Bandwidth bps) request packets. The neighbor then provides the
OSPF Concepts & Structure: requested link-state information in link-state
OSPF depends on the following concepts update packets, full: in this state router are fully
adjacent with each other and the entire routers
Neighbor table: Contains all discovered database are synchronized
OSPF neighbors with whom routing information
will be interchanged. NOTE: The DR and BDR that achieve FULL state
The neighbor table contains the following with every router on the segment will display
fileds: FULL/DROTHER when you enter the show ip ospf
1. Neighbor ID: This is the router ID of the neighbor command on either a DR or BDR. This
neighbor router. The ID will take the highest IP simply means that the neighbor is not a DR or
address among the loopback IP if configured else BDR, but since the router on which the command
was entered is either a DR or BDR, this shows the
neighbor as FULL/DROTHER.
1

4. Dead Time: indicate the remaining time that
the router waits to receive Hello Packet from its
neighbor before declaring it down. In the broadcast
and point to point network the Dead Time is 40
Seconds & in the non broadcast multiple access is
120 seconds.
5. Address: The Address field indicates the IP
address of the interface to which this neighbor is
directly connected.
6. Interface : The Interface field indicates the
interface on which the OSPF neighbor has formed
adjacency
Topology Table: Contains the whole map of
the network with all available OSPF routers.
Routing Table: Contain the current working
best paths that will be used to forward data traffic
between neighbors
OSPF Areas: Routing Areas is distinguished
notion in the OSPF, it means dividing routers into
autonomous system running OSPF process, each
area represents a group of connected routers in
order to optimize resources and administration,
the first area is called Backbone.
Advantages of Areas:
The Area boundaries will give the
opportunity of using summarization.
Area boundaries will also help preventing
fault containment by suppressing updates that
take place when a change occurs in the network
causing a flood of updates between routers.
OSPF Packets:
1) Hello Packet: These packets are sent
periodically (10 sec) on all interfaces (including
virtual links) in order to establish and maintain
neighbor relationships. Hello Packets are
multicast.
Multicast address for OSPF
224.0.0.5 DR to others
224.0.0.6 other send to DR
Hello packet contains: Network mask,
Options, Hello Interval, Router Priority, Router
Dead Interval, Designated Router ID, Backup
Designated Router ID and Neighbor IDs from
whom hello packets have been received.
2
2) The Database Description Packet DBD: packet
contains all updated link-state information
exchanged among the network, and all routers
within the same area have identical LSDB, and
when two routers form new neighbor
adjacency, they sync their LSDB to be fully
adjacent.
It contains:
I-bit: The Init bit. When set to 1, this packet is
the first in the sequence of Database
Description Packets.
M-bit: The More bit. When set to 1, it
indicates that more Database Description
Packets are to follow.
MS-bit: The Master/Slave bit. When set to 1, it
indicates that the router is the master during
the Database Exchange process. Otherwise,
the router is the slave.
DD: sequence number Used to sequence the
collection of Database Description Packets.
The initial value (indicated by the Init bit being
set) should be unique. The DD sequence
number then increments until the complete
database description has been sent.
3) The link state request Packet LSR:
Once neighbor adjacency is formed and LSDB
is exchanged, neighbor routers may locate
missing LSDB information, they then send a
request packet to claim the missing piece, and
neighbors receive this packet and respond
with LSU.
4) The Link state update Packet LSU: A response
packet sends a specific piece of LSDB
information requested by an OSPF neighbor
via LSR packet.
5) Link State Acknowledgment LSA Ack: The
router that sends the LSR packet confirms
receiving the LSU from neighbor by sending a
confirmation packet acknowledging receiving
the requested LSUs.
Area Boarder Routers (ABR):
Routers located on the borders of
each Area connect to more than one OSPF area,
are called ABR Routers. ABR Routers are
responsible for summarizing IP addresses of each
area and suppressing updates among areas to
prevent fault containment.
 Autonomous System Boundary Router
(ASBR):
An ASBR is a router that has interfaces connected
to one or more OSPF areas, similarly as the ABR,
however the difference with an ASBR is that it also
connects to other routing systems such
as BGP, EIGRP, Internet and others.
An ASBR router normally advertises routes from
other routing systems into the OSPF area to which
it belongs.
Designated Router (DR & BDR):
A Designated Router is elected by the routers on
multi-access segments based on its priority
(Router ID, priority). The DR router performs
special functions such as generating Link State
Advertisements (LSAs) and exchanging
information with all other routers in the
same Area. Every router in the same Area will
create an adjacency with the DR and BDR. the BDR
will be active if DR fails.
OSPF Operations:
Establish neighbor adjacencies: OSPF-enabled
routers must form adjacencies with their
neighbor before they can share information
with that neighbor. An OSPF-enabled router
sends Hello packets out all OSPF-enabled
interfaces to determine whether neighbors are
present on those links. If a neighbor is present,
the OSPF-enabled router attempts to establish
a neighbor adjacency with that neighbor.
Exchange link-state advertisements: After
adjacencies are established, routers then
exchange link-state advertisements (LSAs). LSAs
contain the state and cost of each directly
connected link. Routers flood their LSAs to
adjacent neighbors. Adjacent neighbors
receiving the LSA immediately flood the LSA to
Build the topology table: After the LSAs are
received, OSPF-enabled routers build the
topology table (LSDB) based on the received
LSAs. This database eventually holds all the
information about the topology of the network.
It is important that all routers in the area have
the same information in their LSDBs.
Execute the SPF algorithm: Routers then
execute the SPF algorithm. The SPF algorithm
creates the SPF tree.
Build the routing table: From the SPF tree, the
best paths are inserted into the routing table
Cisco OSPF basic Commands :
1) Enable OSPF process and name it 1
Adding the network 192.168.12.0
with its wildcard mask 0.0.0.255
area 0
(Config) #router ospf 1
(Config) #network 192.168.12.0 0.0.0.255 area 0
2) Giving a priority manually to a router
R(config-if)# ip ospf priority <0-255>
3) Enable OSPF Authentification :
interface Serial0
ip address 192.16.64.2 255.255.255.0
ip ospf authentication-key c1$c0
4) Display the OSPF database :
Router# show ip ospf database
5) Display the OSPF neighbors
Router# show ip ospf neighbor
6) Display OSPF interface description
show ip ospf interface ethernet 0
7) Display OSPF routes
Show ip route ospf
References:
www.cisco.com
www.networklessons.com
www.firewall.cx
www.freesoft.org
om
All the best for all
Bonne chance tous
Prepared by Mechouma Toufik
Email:toufikmechouma@gmail.com
If you notice any mistakes please
communicate them to above email.