Open Shortest Path First (OSPF)

You might also like

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 13

Open Shortest Path First

(OSPF)

1
Agenda

 OSPF Basics
 OSPF Terminology

 SPF Tree Calculation

 Verifying OSPF

2
OSPF Basics

3
OSPF Basics (1)
 Open standards.
 Use Dijkstra algorithm.
 It only supports IP routing.
 OSPF is supposed to be designed in a hierarchical
fashion  separate the larger internetwork into
smaller internetworks called areas.
 To decrease routing overhead
 To speed up convergence
 To confine network instability to single area
 Area 0  backbone area.

4
OSPF Basics (2)

5
OSPF Terminology

6
OSPF Terminology (1)
 Link  a network or router interface.
 Router ID  an IP address used to identify the router 
highest loopback interfaces.
 Neighbors  routers that have an interface on a common
network.
 Adjacency  relationship between two OSPF routers that
permits the direct exchange of route updates.
 Neighborship database  a list of all OSPF routers for which
Hello packets have been seen.
 LSA (Link State Advertisement)  an OSPF data packet
containing link-state and routing information that’s shared
among OSPF routers.
7
OSPF Terminology (2)

 Topology database  information from all of the LSA


packets.
 Designated Router (DR)
 All routers on the multi-access network will establish
adjacencies with the DR and BDR.
 Highest priority  router ID is used as a tiebreaker.
 Backup Designated Router (BDR)
 A hot standby for the DR.

8
Type of Networks
 Broadcast multi-access
 A DR and a BDR must be elected.
 Ethernet
 Nonbroadcast multi-access (NBMA)
 A DR and a BDR must be elected.
 Frame relay, X.25, ATM
 Point-to-point
 Direct connection between two routers  physical or logical.
 Point-to-multipoint
 A series of connections between a single interface on one
router and multiple destination routers.
 All of the interfaces belong to the same network.
9
SPF Tree Calculation

10
SPF Tree Calculation
 Shortest Path First (SPF) algorithm.
 Each router constructing a tree  the router is the
root and all other networks are arranged along the
branches and leaves.
 Separate trees will be constructed for each area.
 OSPF metric  cost.
 Cisco bases link cost on bandwidth  108/bandwidth

11
Verifying OSPF

12
OSPF Troubleshooting
Commands
 show ip route
 shows the entire routing table
 show ip ospf
 displays OSPF information
 show ip ospf database
 displays the topology database
 show ip ospf interface
 displays all interface-related OSPF information
 show ip ospf neighbor
 shows all OSPF neighbors

13

You might also like