SlideServe
Menu
Preferences
© SlideServe · v2026

Understanding OSPF Packet Processing in Scalable Multiarea Networks

nia avatar
14 slides · 314 Views · Sep 10, 2014

This document provides an overview of OSPF (Open Shortest Path First) packet processing, focusing on its functionality within scalable multiarea networks. Key OSPF functions include discovering neighbors, forming adjacencies, flooding the link-state database (LSDB), computing shortest paths, and updating routing tables. Additionally, it details the various OSPF packet types, neighbor states, and the significance of maintaining LSDB synchronization. Debugging OSPF packets is also discussed to ensure proper packet flow and network stability.

Understanding OSPF Packet Processing in Scalable Multiarea Networks - slide 1
01 / 14Understanding OSPF Packet Processing in Scalable Multiarea Networks
1 / 17

Download Presentation

Understanding OSPF Packet Processing in Scalable Multiarea Networks
An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

More Related Content

Presentation Transcript
  1. How OSPF Packet Processes Work Implementing a Scalable Multiarea Network OSPF-Based Solution

  2. OSPF Functions • High-level functions of OSPF include the following: • Discover neighbors and form adjacencies • Flood link-state database (LSDB) information • Compute the shortest path • Install routes in the route-forwarding table • Additional functions of OSPF include the following: • Detect changes in the link state • Propagate changes to maintain link-state database synchronization • Several OSPF packet types are involved

  3. OSPF Packet Header Format • This debug output shows fields in the OSPF header. R1#debug ip ospf packet OSPF packet debugging is on R1# *Feb 16 11:03:51.206: OSPF: rcv. v:2 t:1 l:48 rid:10.0.0.12 aid:0.0.0.1 chk:D882 aut:0 auk: from Serial0/0/0.2

  4. OSPF Packet Types • OSPF uses five types of routing protocol packets.

  5. Neighbor Relationship: The Hello Packet • * Entries must match on neighboring routers

  6. OSPF Routing Update Packets • Use of Multicast and unicast IP address • Four types of update packets • LSDB synchronization process • Discover neighbor • Establish bidirectional communication • Elect a designated router, if desired • Form an adjacency • Discover the network routes • Update and synchronize link-state databases

  7. Establishing Bidirectional Communication

  8. Discovering the Network Routes

  9. Adding the Link-State Entries

  10. OSPF Neighbor States • OSPF routers progress through seven states: • Down:no active neighbor detected • INIT:hello packet received • Two-way:own router ID in received hello • Exstart:master and slave roles determined • Exchange:database description packets sent • Loading:exchange of LSRs and LSUs • Full:neighbors fully adjacent

  11. Flooding Changes in Topology • Router R1 that detects a topology change adjusts its LSA and floods the LSA: • Router R1 notifies all OSPF neighbors using 224.0.0.5, or, on LAN links, all OSPF DRs and BDRsusing 224.0.0.6. • The DR notifies others on 224.0.0.5. • The LSDBs of all routers must be synchronized.

  12. The debug ip ospf packet Command • Debugging a single packet • This debug output shows the fields in the OSPF header. R1#debug ip ospf packet OSPF packet debugging is on R1# *Feb 16 11:03:51.206: OSPF: rcv. v:2 t:1 l:48 rid:10.0.0.12 aid:0.0.0.1 chk:D882 aut:0 auk: from Serial0/0/0.2

  13. Summary • There are five OSPF packet types: hello, DBD, LSU, LSR, and LSAck. • The Hello protocol forms logical neighbor adjacency relationships. A DR may be required to coordinate adjacency formations. • The exchange protocol passes through several states (down, INIT, two-way, exstart, exchange, and loading) before finally reaching the goal of the full state. When the protocol is in the full state, its databases are synchronized with adjacent routers. • LSAs are sent when a change occurs, but are also sent every 30 minutes to ensure database integrity. The maximum time that an LSA will stay in the database, without an update, is 1 hour. • Use the debug ip ospf packet command to verify that OSPF packets are flowing properly between two routers.