OSPF is a link-state routing protocol that uses the SPF algorithm to calculate the shortest path to destinations. It maintains neighbor, database, and routing tables. Updates are sent via multicast. Areas allow hierarchical routing. The router ID is the highest IP on an interface. Neighbors must match area ID, authentication, and hello/dead intervals. DR and BDR are elected to reduce adjacencies on multi-access networks. Show commands help troubleshoot OSPF. It requires more resources than other protocols but offers complex capabilities.
OSPF is a link-state routing protocol that uses the SPF algorithm to calculate the shortest path to destinations. It maintains neighbor, database, and routing tables. Updates are sent via multicast. Areas allow hierarchical routing. The router ID is the highest IP on an interface. Neighbors must match area ID, authentication, and hello/dead intervals. DR and BDR are elected to reduce adjacencies on multi-access networks. Show commands help troubleshoot OSPF. It requires more resources than other protocols but offers complex capabilities.
OSPF is a link-state routing protocol that uses the SPF algorithm to calculate the shortest path to destinations. It maintains neighbor, database, and routing tables. Updates are sent via multicast. Areas allow hierarchical routing. The router ID is the highest IP on an interface. Neighbors must match area ID, authentication, and hello/dead intervals. DR and BDR are elected to reduce adjacencies on multi-access networks. Show commands help troubleshoot OSPF. It requires more resources than other protocols but offers complex capabilities.
OSPF is a link-state routing protocol that uses the SPF algorithm to calculate the shortest path to destinations. It maintains neighbor, database, and routing tables. Updates are sent via multicast. Areas allow hierarchical routing. The router ID is the highest IP on an interface. Neighbors must match area ID, authentication, and hello/dead intervals. DR and BDR are elected to reduce adjacencies on multi-access networks. Show commands help troubleshoot OSPF. It requires more resources than other protocols but offers complex capabilities.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 6
4/28/2008
Open Shortest Path First
• Link State Protocol
• Open standard protocol
• Successor of RIP
• Classless routing protocol
• Uses Dijkstra (Shortest Path First (SPF)) Algorithm
• Updates are sent through Multicast IP address 224.0.0.5
• Administrative distance is 110
• Metric = Cost =108/Bandwidth in bps (CISCO)
• Unlimited Hop Count
1 4/28/2008
OSPF (contd..)
• Hello packets are sent every 10 seconds
• Triggered Updates
• Faster Convergence
• Hierarchical design with Multiple Areas
• One area has to be designated as Area 0
• Area 0 is called the backbone area
• Router ID
Router ID is used to identify the Router. The highest IP assigned to
a logical interface (loopback) is the Router ID. If no logical interface
is created then the highest IP assigned to an active physical
interface.
OSPF (contd..)
• Neighbor
• Routers that share a common link become neighbors.
• Neighbor are created by Hello Packets
• To become neighbors the following should match
• Area ID
• Authentication
• Hello and Dead Intervals
2 4/28/2008
OSPF Tables
• It maintains three tables :
Neighbor Table
Neighbor table contains information about the directly connected
OSPF neighbors forming adjacency.
Database table
Database table contains information about the entire view of the
topology with respect to each router.
Routing information Table
Routing table contains information about the best path calculated
by the shortest path first algorithm in the database table.
