OSPF Protocol: Key Concepts and Routing Tables
Delve into the world of OSPF protocol, a link-state protocol designed to provide efficient routing in networks. Learn about OSPF's role as a third-layer protocol, how it uses Dijkstra's algorithm to build routing tables, and how it overcomes the limitations of distance vector protocols. Explore OSPF routing tables and gain insights into how OSPF constructs its routing table using cost calculation based on line speeds. Uncover the essentials of OSPF routing, including IP route display, OSPF database details, and neighbor information.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
OSPF Protocol Page 1
What is OSPF ? OSPF stands for Open Shortest Path First OSPF considered as thired layer Protocol OSPF is Industry Standard that means it is not monopoly for any company OSPF is a link-state Protocol Page 2
What is link-state Protocol ? developed to overcome the disadvantages of the distance vector protocols 1. Each router is responsible for meeting its neighbors and learning their names. Each router constructs a link state packet (LSP) which consists of a list of names and cost for each of its neighbors. The LSP is transmitted to all other routers. Each router stores the most recently generated LSP from each other router. Each router uses complete information on the network topology to compute the shortest path route to each destination node. 2. 3. 4. Page 3
How OSPF builds its routing table ? OSPF chooses the best route depending on the cost using this formula on each link Cost = 100,000,000/Line Speed Page 4
How OSPF builds its routing table ? OSPF uses Dijkstra s Algorithm to choose the best route then comparing it to its database to build the routing table . Page 5
OSPF Routing tables Page 6
OSPF Routing tables # show ip route Page 7
OSPF Routing tables # show ip ospf database Page 8
OSPF Routing tables # show ip ospf neighbor Page 9
