Course Name
OSPF – Open Shortest Path First Training
Course Overview
This course on OSPF Open Shortest Path First training is designed for people who work on development, testing and verification of OSPF protocol. Participants will learn the internals of OSPF protocol that helps them with a much better understanding of their current OSPF work.
Target Audience
- Professionals and Students who are working in Storage/Networking/IT Domain
- Developers, Testers/QA and Verification Engineers who are working on or keen to know Open Shortest Path First
Fee, Schedule & Registration
Click Here for OSPF – Open Shortest Path First Training course, training schedule, fee and registration information.
OSPF – Open Shortest Path First Training Course Outline
Protocol Overview The Topological Database Point-to-point networks Broadcast networks Non-broadcast networks The shortest-path tree Use of external routing information Equal-cost multipath TOS-based routing |
Splitting the AS into Areas The backbone of the Autonomous System Inter-area routing Classification of routers – Internal routers – Area border routers – Backbone routers – AS boundary routers A sample area configuration IP subnetting support Supporting stub areas Partitions of areas |
Functional Summary Inter-area routing AS external routes Routing protocol packets Basic implementation requirements – IP multicast – Lower-level protocol support – Non-broadcast lower-level protocol support – List manipulation primitives – Tasking support Optional OSPF capabilities – External routing capability – TOS capability |
Protocol Data Structures Router ID Pointers to area structures Pointer to the backbone structure Virtual links configured List of external routes |
The Area Data Structure Area ID List of component address ranges Associated router interfaces List of router links advertisements List of network links advertisements List of summary links advertisements |
Bringing Up Adjacencies The Hello Protocol The Synchronization of Databases The Designated Router The Backup Designated Router The graph of adjacencies |
Protocol Packet Processing Sending protocol packets Receiving protocol packets |
The Interface Data Structure Interface states Events causing interface state changes The Interface state machine Electing the Designated Router Sending Hello packets |
The Neighbor Data Structure Neighbor states Events causing neighbor state changes The Neighbor state machine Whether to become adjacent Receiving Hello packets Receiving Database Description Packets Receiving Link State Request Packets Sending Database Description Packets Sending Link State Request Packets An Example |
The Routing Table Structure Routing table lookup Sample routing table, without areas Sample routing table, with areas |
Link State Advertisements The Link State Header – LS age – Options – LS type – Link State ID – Advertising Router – LS sequence number The link state database Representation of TOS Originating link state advertisements – Router links – Network links – Summary links – AS external links |
The Flooding Procedure Determining which link state is newer Installing link state advertisements in the database Next step in the flooding procedure Receiving self-originated link state Sending Link State Acknowledgment packets Retransmitting link state advertisements Receiving link state acknowledgments |
Aging The Link State Database Premature aging of advertisements |
Virtual Links |
Calculation Of The Routing Table Calculating the shortest-path tree for an area – The next hop calculation Calculating the inter-area routes Resolving virtual next hops Calculating AS external routes Incremental updates — summary links Incremental updates — AS external links Events generated as a result of routing table changes Equal-cost multipath Building the non-zero-TOS portion of the routing table |