What Does Broadcast OSPF Mean?

Imagine a large office where every employee needs to know about every new project. If each person had to tell every other person individually, it would be chaos and time-consuming. Instead, the office elects a project manager and an assistant project manager. Whenever someone has a project update, they only tell the project manager. The project manager then gives that update to everyone else. This saves time and prevents mistakes.

Broadcast OSPF works in a similar way on a computer network. When you have a network type like Ethernet (the kind of cable most likely connecting your home router to your computer), many routers can be connected to the same network segment. In OSPF, a routing protocol that helps routers find the best paths for data, the Broadcast mode is designed for just this situation.

Instead of every router sending its routing table to every other router (which would create a huge amount of traffic), Broadcast OSPF elects one router as the Designated Router (DR) and another as the Backup Designated Router (BDR). The DR acts like the project manager. All other routers (called DROthers) send their routing information only to the DR and BDR. The DR then sends one single update to all routers. This is much more efficient.

The "broadcast" part of the name comes from the fact that Ethernet networks use broadcast messages to reach all devices at once. OSPF uses this ability to automatically discover neighbor routers without manual configuration. Routers send hello packets to a special multicast address (224.0.0.5 for OSPF) that all OSPF routers listen to, making discovery automatic.

One key detail is that not all network types use this mode. For example, serial point-to-point links (like older internet connections) use a different mode because there are only two routers on the link. But on a typical Ethernet local area network (LAN) with many routers, Broadcast OSPF is the default and most efficient choice.

This built-in election process is automatic, but network engineers can influence it by setting router priorities. The router with the highest priority becomes the DR. If there is a tie, the router with the highest Router ID (usually the highest IP address on a loopback interface) wins. If the DR fails, the BDR takes over, and a new BDR is elected. This ensures the network keeps running smoothly even if a router goes down.

Open Shortest Path First (OSPF) is a link-state routing protocol defined in RFC 2328. It operates within an Autonomous System (AS) and uses Dijkstra's Shortest Path First (SPF) algorithm to compute loop-free paths to all destinations. OSPF supports different network types, each with specific behavior for neighbor discovery, adjacency formation, and database synchronization. One of the most common network types is Broadcast OSPF.

Broadcast OSPF is defined for multi-access broadcast networks, such as Ethernet (IEEE 802.3) or Token Ring. In such networks, any two devices can communicate directly using a MAC-layer broadcast or multicast capability. OSPF takes advantage of this by using two multicast IP addresses: 224.0.0.5 (AllSPFRouters) and 224.0.0.6 (AllDRouters). Hello packets are sent to 224.0.0.5 to discover neighbors, while Link-State Advertisements (LSAs) are sent to 224.0.0.6 (for DR-to-router updates) or 224.0.0.5 (for DR-to-all updates).

Upon initialization, a router in a Broadcast OSPF network sends Hello packets out all OSPF-enabled interfaces. It listens for Hellos from other routers. These packets contain information such as the Router ID, neighbor list, OSPF timers (Hello Interval, Dead Interval), and the router's priority for DR/BDR election. Once a router hears a Hello from another router, it enters the Init state and then the 2-Way state when it sees its own Router ID in the neighbor's Hello packet.

The Designated Router (DR) election process is deterministic. Routers compare their OSPF priority (ranging from 0 to 255, with 0 meaning never a DR/BDR). The Router with the highest priority becomes the DR, and the next highest becomes the BDR. If priorities are equal, the Router with the highest Router ID wins. The election is non-preemptive; once a DR is elected, it remains until it fails (unless a higher priority router appears during the election process itself).

After the DR and BDR are elected, the adjacency formation proceeds through the ExStart state, where the master/slave relationship is established, and the Exchange state, where Database Description (DBD) packets are exchanged. The Loading state follows, where Link-State Request (LSR), Link-State Update (LSU), and Link-State Acknowledgment (LSAck) packets are used to synchronize the Link-State Database (LSDB). Finally, the Full state is reached, indicating that the routers are fully adjacent.

In Broadcast OSPF, only DR and BDR form full adjacencies with all routers on the segment (DROthers). DROthers form only two-way neighbor relationships with each other; they do not exchange LSAs directly. This drastically reduces the number of adjacency relationships. For example, if there are 10 routers on a broadcast segment, the number of full OSPF adjacencies is 2*(N-1) = 18, instead of N*(N-1)/2 = 45 in a fully meshed setup. This translates to less CPU and memory usage, lower bandwidth consumption, and faster convergence.

LSAs generated by DROthers are sent to the DR and BDR using multicast address 224.0.0.6. The DR then floods a single LSA to all routers (using 224.0.0.5) and ensures that the LSDB is consistent across the segment. The BDR listens to all updates but does not flood them, keeping itself ready to take over if the DR fails.

Standards compliance: Broadcast OSPF adheres to RFC 2328, section 9.1 (Neighbor and Adjacency Establishment) and section 9.4 (DR Election). It also relies on IP protocol 89 for OSPF packet transport. The network type is configurable per interface using the command `ip ospf network broadcast` in Cisco IOS (though it is the default on Ethernet interfaces). Common troubleshooting involves verifying that all routers agree on the same Hello/Dead timers and that the subnet mask matches across the segment.

Real IT implementation considerations include ensuring that Layer 2 switching domains are not overly large (to limit DR election storms), using OSPF priority to designate specific routers as DR (e.g., a core router), and preventing routers from becoming DR if they have low processing power (by setting priority to 0). Broadcast OSPF is typically chosen for campus networks, data center leaf-spine topologies (with careful design to avoid suboptimal paths), and any environment where Ethernet is the primary medium.

Broadcast OSPF directly impacts the stability and efficiency of modern IT networks. Most enterprise networks today use Ethernet as their primary Layer 2 technology. Office LANs, data center server racks, and campus backbones are all broadcast multi-access networks. Understanding Broadcast OSPF is essential for network engineers designing or troubleshooting these environments.

One critical practical aspect is scalability. Without the DR/BDR mechanism in Broadcast OSPF, every router would need to form a full adjacency with every other router on the same segment. For a segment with 10 routers, that is 45 full adjacencies. With Broadcast OSPF, it drops to 18. This reduction matters when routers are low on CPU and memory, or when the network link is limited in bandwidth. In a large data center with hundreds of switches, using Broadcast OSPF improperly could cause adjacency churn during convergence, leading to packet loss.

Another reason it matters: OSPF is not just a certification topic; it is widely deployed. Network professionals must decide when to use Broadcast OSPF versus other network types like Point-to-Point (p2p) or Non-Broadcast Multi-Access (NBMA). Choosing incorrectly can prevent routers from forming adjacencies. For example, running OSPF over a Frame Relay network (an NBMA technology) with broadcast mode would require manual neighbor configuration because there is no native broadcast. Misunderstanding this can cause total routing failure.

IT professionals must know how to troubleshoot Broadcast OSPF issues. Common problems include mismatched Hello or Dead timers, subnet mismatches, or DR election issues where an unintended router becomes the DR, causing suboptimal routing paths. Being able to verify DR/BDR status, adjust OSPF priority, and troubleshoot adjacency states is a daily task for network administrators.

Finally, Broadcast OSPF is foundational for advanced networking concepts like OSPF stub areas, virtual links, and multi-area OSPF. A solid grasp of how LSAs flow within a broadcast segment enables engineers to tune network convergence and design resilient topologies. Whether you are working toward the CCNA, Network+, or AWS certifications, understanding Broadcast OSPF is not optional; it is core to routing knowledge.

Broadcast OSPF questions appear in three main patterns: scenario-based, configuration-based, and troubleshooting-based. Scenario questions often present a network diagram with three or four routers connected to a Layer 2 switch. They will give you the OSPF priority and Router ID for each router and then ask, "Which router will be the DR?" or "Which router will be the BDR?" The trick often involves a router with priority 0 (cannot be DR/BDR) or a tie-breaking based on Router ID.

Example: Router1 priority 100, Router ID 1.1.1.1. Router2 priority 100, Router ID 2.2.2.2. Router3 priority 50, Router ID 3.3.3.3. The question might ask: "After election, which routers are fully adjacent?" The correct answer is that Router1 (DR) and Router2 (BDR) are fully adjacent with each other and with Router3, but Router3 is only 2-way with the others (unless you are the DR/BDR, you do not form full adjacency with other DROthers).

Configuration questions may ask you to assume that you need to ensure a specific router becomes the DR on a new segment. You would set its OSPF priority to the highest value, or you can set all other routers to priority 0. A typical multiple-choice: "Which command ensures Router A becomes the DR?" Answer: `interface GigabitEthernet 0/0` then `ip ospf priority 255`.

Troubleshooting questions are common in the CCNA and Network+. The scenario might say: "Two routers are connected via Ethernet and configured for OSPF area 0. They do not form an adjacency. What is the most likely cause?" Options include mismatched Hello timers, mismatched subnet masks, or the OSPF network type being set to point-to-point on one side. Another common trap: "The DR fails. What happens to OSPF on the segment?" Learners must know that the BDR becomes the DR, and a new BDR is elected. They might incorrectly think the network stops routing, but OSPF is designed for fast convergence.

On the CompTIA Network+, a typical question is: "What is the purpose of the Designated Router in OSPF?" The answer choices include: "to reduce the number of routing updates on a broadcast network" (correct) vs. "to provide backup for OSPF updates" (incorrect, that is BDR).

To prepare, practice with simulations where you configure OSPF on routers, change network types, and verify with `show ip ospf neighbor` and `show ip ospf interface`. Understand what each state means. For the exam, memorize the DR election process and the adjacency state machine.

Broadcast OSPF is the default behavior on any Ethernet interface running OSPF. As a network professional, you may need to change this if you are connecting over a different Layer 2 technology, such as a multipoint Frame Relay or an Ethernet VPN (EVPN). However, in most campus and data center networks, leaving it as broadcast is fine.

One critical practical aspect is ensuring all routers on the same segment have consistent OSPF parameters. Mismatched Hello or Dead timers will prevent adjacency formation. For example, if one router is configured with Hello Interval of 10 seconds (default) and another with 30 seconds, they will not become neighbors. Use the `show ip ospf interface` command to verify these values.

Another common task is influencing the DR election. In many designs, you want a centralized core router to be the DR because it has the best path to the rest of the network. To guarantee this, set its priority to 255 and set all other routers to a lower priority. But be careful: if a new router joins the segment with a higher priority, it will not preempt the existing DR unless the DR fails (non-preemptive). So you must plan the order of bring-up or manually restart the OSPF process on the current DR to force a new election.

What can go wrong? One classic problem is when an unintended router becomes the DR. Suppose you have a small branch router with low processing power connected to a broadcast segment with core routers. If the branch router has the highest OSPF priority (by accident or default), it becomes the DR. This can overload the branch router because it must now process all LSAs and flood them to all neighbors. The fix is to set its priority to 0 so it can never be DR/BDR.

Another issue is in virtualized environments. When you create OSPF adjacencies between virtual routers on the same hypervisor (e.g., using VIRL, EVE-NG), make sure the virtual switch supports multicast. Some virtual switches may drop multicast packets, causing neighbor discovery to fail.

For multi-area OSPF, broadcast networks play a role in LSA type 2 (Network LSAs). The DR originates a Network LSA that lists all routers on the segment, which helps other routers build the network topology. Understanding this helps when troubleshooting area border routers.

Professionals also need to know that Broadcast OSPF consumes more resources than point-to-point because of the DR/BDR election process and the additional DB exchange. In large leaf-spine data centers, it is common to use point-to-point OSPF on every link (even if physical is Ethernet) to simplify design and avoid DR election entirely. You would configure `ip ospf network point-to-point` on each interface.

Finally, always verify your OSPF neighbor states with `show ip ospf neighbor`. If you see a state other than Full or 2-Way, it indicates an issue. For example, ExStart/Exchange indicates database synchronization problems. This is your first line of troubleshooting.

A powerful mini-lesson for exams: draw a diagram with four routers on a switch. Assign priorities and Router IDs. Run through the election. Then kill the DR. See how BDR takes over. That mental model will answer half the OSPF questions.

Broadcast OSPF is a specialized network type used in OSPF (Open Shortest Path First) routing that is designed for multi-access networks where multiple routers can be connected to a common physical or logical segment, such as Ethernet. Unlike point-to-point or point-to-multipoint network types, broadcast OSPF takes advantage of the inherent broadcast capability of the underlying data link layer to automatically discover neighbors without manual configuration. In a broadcast network, OSPF routers dynamically discover each other by sending OSPF Hello packets to the multicast address 224.0.0.5 (AllSPFRouters) and 224.0.0.6 (AllDRouters). This eliminates the need for neighbor statements, making configuration simpler and more scalable on LAN segments.

The key characteristic that sets broadcast OSPF apart is the election of a Designated Router (DR) and a Backup Designated Router (BDR). Because a broadcast network can have many routers attached to the same segment, flooding every Link State Advertisement (LSA) to every neighbor would create a massive amount of redundant traffic. The DR becomes the central point for LSA flooding: all routers on the segment form an adjacency only with the DR and BDR, not with every other router. The DR then forwards LSAs to all other routers on the segment, greatly reducing the number of adjacencies from N*(N-1)/2 to just (2*(N-2)) + 1. This efficiency is critical for large enterprise or campus networks where dozens of routers might share a single Ethernet VLAN.

Another critical distinction is the Hello and Dead intervals. On broadcast networks, the default Hello interval is 10 seconds, and the Dead interval is 40 seconds (four times the Hello interval). This is consistent across most OSPF implementations for broadcast and point-to-point networks, but it differs from non-broadcast multi-access (NBMA) networks where the Hello interval is often 30 seconds. The 10-second Hello interval is a trade-off: it ensures fast convergence when a neighbor fails (detected after 40 seconds) while keeping bandwidth consumption manageable on high-speed LANs.

Broadcast OSPF requires that all routers on the segment belong to the same subnet and are configured with the same IP subnet mask. This is because the OSPF interface state machine relies on the network mask to determine the network type. On broadcast networks, multicast capabilities must be supported by the underlying medium. This works on Ethernet, but can cause issues on technologies like Frame Relay or ATM if not properly configured with the 'ip ospf network broadcast' command.

For exam purposes, understanding broadcast OSPF is essential because it is one of the most commonly tested OSPF network types, particularly in CCNA, Network+, and security-focused exams where OSPF behavior in LAN environments is a key topic. The automatic neighbor discovery and DR/BDR election process are classic multiple-choice and simulation topics. Candidates must remember that DR and BDR elections are based on the highest OSPF interface priority (default 1) and, as a tiebreaker, the highest Router ID. A router with priority 0 never becomes DR or BDR. Also, the DR/BDR election is not preemptive unless the router is restarted, meaning once a DR is elected, it remains the DR even if a higher-priority router joins the network. This non-preemptive behavior is a frequent exam trick.

broadcast OSPF is the default network type on Ethernet interfaces and is characterized by automatic neighbor discovery via multicast, DR/BDR election for LSA flooding optimization, 10-second Hello intervals, and subnet-mask homogeneity. Mastering these details will help you answer many exam questions about OSPF neighbor states, adjacencies, and network scalability.

In Broadcast OSPF, the election of the Designated Router (DR) and Backup Designated Router (BDR) is one of the most critical processes for ensuring efficient flooding of Link State Advertisements (LSAs). The DR serves as the focal point for all OSPF traffic on a multi-access segment. Every router on a broadcast network forms a full OSPF adjacency only with the DR and the BDR, not with every other router. This reduces the number of adjacencies from O(N^2) to O(N), which is vital for scalability on networks with many routers.

Election Process Steps

1. Wait State: When an OSPF interface on a broadcast network first comes up, it enters the Waiting state. During this period (which lasts for the RouterDeadInterval, typically 40 seconds), the router listens for Hello packets from other routers on the segment. It does not participate in the DR/BDR election until the Waiting timer expires. This is to ensure that the router has a complete view of all potential candidates before voting.

2. Priority-Based Selection: The OSPF interface priority is the most important factor. Each interface on a router can be assigned a priority value from 0 to 255 using the command "ip ospf priority <0-255>". The default priority is 1. A router with a priority of 0 is ineligible to become a DR or BDR. A higher priority (numerically greater) makes a router more likely to win the election. For example, a router with a priority of 100 will be chosen as DR over a router with priority 50.

3. Router ID Tiebreaker: If two or more routers have the same priority, the election is decided by the highest Router ID (RID). The RID is a 32-bit number that can be manually configured with the "router-id" command, or is automatically selected as the highest IP address on a loopback interface, or the highest active physical interface IP. Since Router IDs are unique within an OSPF domain, this tiebreaker guarantees a deterministic outcome.

4. Non-Preemptive Nature: Crucially, the DR and BDR election is non-preemptive. Once a DR and BDR are elected, they remain in those roles until one of them fails or the OSPF process is reset. If a new router with a higher priority joins the network later, it will not take over as DR or BDR unless the current DR or BDR goes down. This avoids instability caused by frequent role changes. However, if the DR fails, the BDR automatically becomes the new DR, and a new BDR is elected from the remaining routers.

5. When Election Occurs: The election happens after the Waiting state expires, or when two-way communication is established with all neighbors on the segment, whichever occurs later. It does not happen immediately upon receiving Hello packets. Also, the election is performed independently by each router, but because all routers have the same set of candidates (via Hello exchange), the outcome is consistent across the network.

Exam-Relevant Details - The default priority of 1 means that most routers are eligible, but misconfiguration (priority 0) can accidentally exclude a router from becoming DR, potentially impacting network design. - In labs and exam simulations, you may be asked to determine which router becomes DR given a list of priorities and Router IDs. Always sort by priority (descending), then by Router ID (descending). - The DR/BDR concept only applies to broadcast and NBMA network types. In point-to-point networks, there is no DR/BDR because there are only two routers on the link. - The DR's IP address is listed in Hello packets as the "DR" field, and similarly for the BDR. This field is used by routers to know who the current DR and BDR are. - If all routers on the segment have priority 0, no DR or BDR is elected, and all routers remain in the 2-WAY state. This is a potential troubleshooting scenario where full adjacencies never form and LSAs are not flooded properly.

Understanding the DR/BDR election process is essential for both exam success and real-world network design. It is a frequent topic in CCNA, Network+, and even security exams because it directly affects OSPF convergence, stability, and traffic patterns.

In Broadcast OSPF, the process of forming neighbor adjacencies follows a defined state machine that is central to both network operation and exam testing. The states represent the progression of the relationship between two OSPF routers on a multi-access network. Because broadcast networks require DR/BDR election, some states (like 2-WAY and ExStart) have specific behaviors that differ from point-to-point networks.

The OSPF neighbor state progression typically goes: Down -> Attempt (on NBMA only) -> Init -> 2-Way -> ExStart -> Exchange -> Loading -> Full. However, on broadcast networks, "Attempt" is not used; routers go directly from Down to Init.

Detailed State Transitions on Broadcast Networks:

1. Down State: The initial state. No Hello packets have been received from the neighbor. This is the starting point when an interface comes up or when a neighbor is not reachable.

2. Init State: A Hello packet has been received from the neighbor, but the router's own Router ID is not yet in the neighbor's Hello packet. This indicates that the neighbor has seen the router but two-way communication is not yet established. In broadcast mode, the Hello is sent to the multicast address 224.0.0.5, so any OSPF-enabled router on the segment that is listening will respond.

3. 2-Way State: Both routers have exchanged Hello packets and see each other's Router ID in their respective Hello packets. This means bidirectional communication is established. On broadcast networks, the 2-Way state is significant because a router decides whether to form a full adjacency based on the DR and BDR roles. Routers become fully adjacent only with the DR and BDR; all other pairs of non-DR/BDR routers stop at the 2-Way state. This is a major difference from point-to-point networks, where every neighbor goes to Full.

4. ExStart State: The master/slave relationship is established for the Database Description (DBD) packet exchange. The master controls the exchange and counts sequence numbers. This is the first step in synchronizing LSDBs. In broadcast OSPF, the router with the higher Router ID becomes the master.

5. Exchange State: Routers send DBD packets that contain summaries of their LSDBs. During this state, each router acknowledges received DBD packets and may request more recent LSAs using Link State Requests (LSRs). The DBD packets are sent to the AllSPFRouters multicast address (224.0.0.5) but only the neighbor that is in the appropriate state processes them.

6. Loading State: A router sends LSRs for LSAs that it does not have or that are more recent. The neighbor responds with Link State Updates (LSUs). This continues until both routers have identical LSDBs.

7. Full State: The routers are fully adjacent, and their LSDBs are synchronized. This is the desired state for DR-to-router adjacencies and BDR-to-router adjacencies. Neighbors that are not DR/BDR will remain in 2-Way and never reach Full with each other.

Exam Key Points: - On broadcast networks, a router will not transition past 2-Way with a neighbor unless that neighbor is the DR or BDR. This is tested frequently: "How many full adjacencies exist on a broadcast segment with N routers?" Answer: 2*(N-2) + 1 = (2N - 3) full adjacencies (each router adjacent to DR and BDR, plus one adjacency between DR and BDR). - The DR and BDR become fully adjacent with all other routers on the segment, including each other. Non-DR/BDR routers (called DROTHERs) stay at 2-Way with each other. - If a router never sees the DR or BDR (e.g., due to multicast filtering), it will be stuck in Init or 2-Way because it cannot proceed to ExStart without a designated neighbor. - The Hello protocol in broadcast OSPF includes the DR and BDR fields. A router lists the chosen DR and BDR in its Hello packets. This helps other routers know who to form full adjacencies with.

Understanding these states is crucial for troubleshooting OSPF neighbor issues. For example, if a router is stuck in ExStart, it often indicates an MTU mismatch. If stuck in Init, it suggests that unicast communication works but multicast may be blocked. In broadcasts networks, common causes of adjacency failures include incorrect subnet masks or VLSM mismatches, since OSPF requires the same mask on the entire broadcast segment.

Broadcast OSPF relies on a highly optimized Link State Advertisement (LSA) flooding mechanism that uses the DR as a central distribution point. The efficiency gained by the DR/BDR model is critical because in a broadcast network, a single LSA change must be propagated to all routers on the segment without causing unnecessary duplication or bandwidth waste. The two primary types of LSAs that are flooded on broadcast networks are Type 1 (Router LSA) and Type 2 (Network LSA), with Type 2 being unique to multi-access networks.

Flooding Process on Broadcast OSPF:

When a router (non-DR) on a broadcast network originates a new or updated Router LSA, it sends the LSU to the multicast address 224.0.0.6 (AllDRouters), which is listened to only by the DR and BDR. The DR receives the LSU, acknowledges it, and then floods the LSA to all other OSPF routers on the segment by sending it to 224.0.0.5 (AllSPFRouters). The BDR also listens to the initial update but does not flood it unless the DR fails. This design prevents the unnecessary flooding of LSAs to routers that are not directly adjacent. Without the DR, each router would need to send LSAs to every other router individually, which would be highly inefficient and could cause LSA storms.

Another key component is the Network LSA (Type 2). The DR generates the Network LSA on behalf of the broadcast segment. This LSA lists all routers that are fully adjacent to the DR on that segment, including the BDR and all DROTHERs. The Network LSA is essential because it describes the multi-access network as a single node in the SPF tree, reducing the complexity of the graph. For example, in a segment with 10 routers, the SPF algorithm considers the broadcast segment as one vertex and the attached routers as leaf nodes, rather than modeling 10 full mesh connections. The Network LSA is flooded only by the DR and is acknowledged by all routers that receive it.

Route Computation (SPF) in Broadcast OSPF:

When a router runs Dijkstra's Shortest Path First (SPF) algorithm, it processes both Router LSAs and Network LSAs. The Network LSA is treated as a node (with a link cost of 0 from the DR to the network, and the cost from the network to each attached router is 0 by default). The DR is the router that advertises the Network LSA, but the cost from any router to the network is the cost of that router's interface to the link. So, in the SPF tree, the broadcast segment appears as a transit node.

For route calculation: When computing the shortest path to a destination behind a router on the same broadcast segment, the SPF algorithm includes the cost from the local router to the DR (via the broadcast link), then from the DR to the destination router (usually 0 if directly connected), then the cost from that router to the destination. This ensures that traffic takes the optimal path even though routers may not be directly adjacent to each other.

Exam-Relevant Details: - Type 2 LSA (Network LSA) is only generated on broadcast (and NBMA) networks. Point-to-point networks do not produce Type 2 LSAs. This is a classic exam fact. - The Network LSA is one of the reasons why broadcast OSPF is more complex to troubleshoot: if the DR fails, the BDR takes over, and a new Network LSA must be generated by the new DR. During this time, SPF may incorrectly compute routes until the new LSA is flooded. - The LSA flooding mechanism on broadcast networks uses two multicast addresses: 224.0.0.6 (to DR/BDR) and 224.0.0.5 (to all OSPF routers). This means that routers must have multicast support enabled; otherwise, flooding will fail, and adjacencies may not form. - In terms of LSA aging, the DR is responsible for refreshing the Network LSA every 30 minutes (by default). All routers on the segment rely on the DR to keep the Network LSA current. If the DR does not refresh the LSA, it will age out (max age 60 minutes), causing the route to that segment to be removed from the routing table. - The concept of "flooded LSAs" is tested in the context of network convergence. In exams, you may be asked: "During a link failure, how does the router inform other routers?" Answer: The non-DR router sends an LSU to 224.0.0.6, the DR acknowledges and floods to 224.0.0.5.

Understanding the flooding and route computation in broadcast OSPF is critical for designing scalable OSPF networks and for passing industry-standard exams. It also helps in diagnosing performance issues, such as high CPU usage due to frequent SPF recalculations caused by flapping DRs or network instability.