OSPF LSA Refresh Interval and Protocol Mechanics

H12-821 By islever Editorial Last updated

Short answer

B OSPF performs LSDB update every 30 minutes by refreshing self-originated LSAs at the default 1800-second interval.

Question

Which of the following statements regarding OSPF is true?
  1. OSPF does not have an acknowledgement mechanism. Therefore, OSPF relies on the upper-layer protocol, TCP, for acknowledgement.
  2. OSPF performs LSDB update every 30 minutes. Correct Answer
  3. OSPF uses the Bellman-Ford algorithm, and each router independently runs this algorithm.
  4. OSPF floods an LSU packet at an interval of 5s.

Key Takeaways

The main trap is confusing OSPF's link-state SPF algorithm with distance-vector Bellman-Ford, or assuming it uses TCP like other reliable protocols.

This page explains why OSPF updates the LSDB every 30 minutes using the LSA Refresh Interval. It clarifies common misconceptions about OSPF transport, algorithms, and flooding timers.

Common mistake: Option A is often chosen incorrectly because candidates assume all reliable routing protocols use TCP/UDP. OSPF uses IP Protocol 89 and its own acknowledgment mechanisms.

Expert Analysis

The question tests fundamental OSPF protocol mechanics, specifically regarding transport, timers, algorithms, and packet flooding. The correct answer is B.

First, evaluate the transport mechanism. OSPF packets are encapsulated directly in IP with Protocol Number 89; they do not use TCP or UDP. This makes Option A incorrect because OSPF implements its own reliable transmission mechanisms (Hello packets, LSUs, LSRs, LSacks) rather than relying on upper-layer protocols.

Next, consider the database synchronization process. OSPF routers maintain a Link State Database (LSDB). To ensure consistency, each LSA has an age field that increments over time. When an LSA reaches its MaxAge (60 minutes), it is flushed. However, to prevent unnecessary flooding of stable routes, routers refresh LSAs periodically. The default refresh interval for self-originated LSAs is 1800 seconds, which equals 30 minutes. This periodic refresh ensures that all routers in the area have up-to-date information without waiting for the LSA to expire. Therefore, Option B accurately describes this standard behavior.

Regarding the routing algorithm, OSPF is a Link-State protocol that uses the Dijkstra Shortest Path First (SPF) algorithm to calculate the loop-free shortest path tree. In contrast, distance-vector protocols like RIP use the Bellman-Ford algorithm. Thus, Option C is factually incorrect regarding the algorithm type.

Finally, examine the flooding interval. While OSPF does flood Link State Updates (LSUs), the default retransmission interval for unacknowledged LSUs is typically 5 seconds only on slow networks (like Frame Relay) or when configured specifically. On broadcast multi-access networks, the Hello interval is usually 10 seconds, and LSU retransmissions are handled via specific timers, but stating generally that OSPF floods an LSU at an interval of 5s as a universal truth is misleading compared to the definitive nature of the 30-minute refresh rule. Moreover, Option B is a precise definition of the LSA refresh mechanism found in standard documentation.

In summary, Option B correctly identifies the default LSA refresh interval, while A, C, and D contain fundamental errors about OSPF's architecture.

Official Reference

https://www.rfc-editor.org/rfc/rfc2328.html

This link opens the official vendor documentation in a new tab.

Exam Strategy

When analyzing OSPF questions, always verify the underlying algorithm (Dijkstra vs. Bellman-Ford) and the transport layer (IP Proto 89 vs. TCP/UDP). Memorize key default timers: Hello (10s/120s), Dead (40s/120s), and LSA Refresh (1800s/30m). These constants frequently appear as distractors or correct answers.

Frequently Asked Questions

Does OSPF use TCP for reliable delivery?

No. OSPF encapsulates packets directly in IP using Protocol 89. It implements its own reliable transmission using sequence numbers and acknowledgments within OSPF packets.

What is the difference between SPF and Bellman-Ford in routing?

OSPF uses Dijkstra's SPF algorithm to build a shortest path tree based on link states. Distance-vector protocols like RIP use the Bellman-Ford algorithm to determine paths based on hop counts.

More H12-821 FAQ →

Community Votes

B
100%

100% of anonymous learners picked answer B. Votes are pick records left by other test-takers — they are not the verified answer.

Discussion 1 contributions

Compiled from public community threads and reader submissions, lightly edited for clarity. Handles and vote tallies are shown as recorded, and comments reflect the views of individual contributors.

From public community threads 1

  1. HCIP Resolutor 👍 1 Answered B
    OSPF utiliza un mecanismo de refresco periódico de LSAs (LSA Refresh Interval) de 1800 segundos (30 minutos).

Reader comments & corrections

No reader corrections yet — spotted an error or have a note? Share it below.

Log in to comment, report an error, or add a note about this question.

Practice All H12-821 Questions

Access 168 questions with complete answers and detailed explanations.

View Full H12-821 Practice Test →

← Back to H12-821 Study Guide