Link state routing (OSPF) in Computer Networks - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

How does OSPF determine the best path?

OSPF uses a specific algorithm to find the shortest path to each network. Which algorithm does OSPF use?

A Dijkstra's algorithm

B Bellman-Ford algorithm

C Flooding algorithm

D Distance vector algorithm

💡 Hint

Think about which algorithm finds the shortest path in a graph efficiently.

OSPF uses Dijkstra's algorithm to calculate the shortest path tree from the router to all destinations.

📋 Factual

intermediate

What is the role of Link State Advertisements (LSAs) in OSPF?

In OSPF, routers share information about their links using LSAs. What is the primary purpose of LSAs?

A To establish neighbor relationships between routers

B To share the complete topology information with all routers in the area

C To advertise the cost of the path to a destination

D To assign IP addresses to routers

💡 Hint

LSAs help routers build a map of the network.

LSAs carry detailed information about the router's links and are flooded to all routers in the area to build a complete topology map.

🔍 Analysis

advanced

Why does OSPF use areas in its design?

OSPF divides a large network into smaller areas. What is the main advantage of this design?

A To increase the number of routers that can be connected directly

B To enable faster packet forwarding by bypassing routing decisions

C To allow routers to use different routing protocols in each area

D To reduce routing table size and limit the scope of route calculations

💡 Hint

Think about how dividing a network affects the amount of information each router must process.

Areas reduce the size of routing tables and limit the scope of link state updates, improving efficiency and scalability.

❓ Comparison

advanced

How does OSPF differ from Distance Vector routing protocols?

Which of the following is a key difference between OSPF (a link state protocol) and distance vector protocols like RIP?

A OSPF routers have a complete map of the network topology, distance vector routers do not

B OSPF does not support hierarchical routing, distance vector does

C OSPF sends periodic full routing tables to neighbors, while distance vector sends only changes

D Distance vector protocols use Dijkstra's algorithm, OSPF does not

💡 Hint

Consider how each protocol learns about the network.

OSPF routers build a full topology map and calculate routes using Dijkstra's algorithm, while distance vector protocols share only distance information without full topology knowledge.

❓ Reasoning

expert

What happens if two OSPF routers have mismatched hello intervals?

OSPF routers use hello packets to establish neighbor relationships. What is the effect if two routers have different hello intervals configured?

A They will still form a neighbor relationship but exchange routing updates less frequently

B They will form a neighbor relationship but with increased risk of routing loops

C They will not form a neighbor relationship because hello intervals must match exactly

D They will form a neighbor relationship only if their dead intervals match

💡 Hint

Think about what parameters must match for OSPF neighbors to form.

OSPF requires hello intervals to match exactly between neighbors; otherwise, they will not establish adjacency.

Practice

1. What is the main purpose of link state routing in OSPF?

easy

A. To encrypt data for secure transmission

B. To broadcast data packets to all devices in the network

C. To share detailed information about network connections to build a complete map

D. To assign IP addresses to devices automatically

Solution

1. Step 1: Understand link state routing basics

   Link state routing shares detailed information about each router's connections to build a full network map.

2. Step 2: Identify OSPF's role

   OSPF uses this map to find the shortest and best paths for data transmission.

3. Final Answer:

   To share detailed information about network connections to build a complete map -> Option C

4. Quick Check:

   Link state routing = detailed network map [OK]

Hint: Link state routing builds a full network map [OK]

Common Mistakes:

• Confusing link state routing with broadcasting
• Thinking OSPF assigns IP addresses
• Mixing routing with encryption functions

2. Which of the following is the correct way OSPF routers share their link state information?

easy

A. By using static routing tables updated manually

B. By broadcasting their IP addresses every 5 seconds

C. By encrypting data packets with SSL

D. By sending Link State Advertisements (LSAs) to all routers in the area

Solution

1. Step 1: Identify OSPF communication method

   OSPF routers share link state info using Link State Advertisements (LSAs) to all routers in the same area.

2. Step 2: Eliminate incorrect options

   Broadcasting IP addresses or using static tables are not how OSPF shares link states; encryption is unrelated here.

3. Final Answer:

   By sending Link State Advertisements (LSAs) to all routers in the area -> Option D

4. Quick Check:

   OSPF shares info via LSAs [OK]

Hint: OSPF uses LSAs to share link states [OK]

Common Mistakes:

• Confusing LSAs with IP broadcasts
• Thinking OSPF uses static routing
• Mixing routing info sharing with encryption

3. Consider a network running OSPF where Router A has three links with costs 10, 20, and 5. Which link will OSPF prefer to send data through?

medium

A. The link with cost 5

B. The link with cost 10

C. The link with cost 20

D. All links equally

Solution

1. Step 1: Understand OSPF cost metric

   OSPF prefers the path with the lowest cost to send data.

2. Step 2: Compare link costs

   Among costs 10, 20, and 5, the lowest is 5, so OSPF will choose that link.

3. Final Answer:

   The link with cost 5 -> Option A

4. Quick Check:

   Lowest cost link = chosen path [OK]

Hint: OSPF picks the lowest cost path [OK]

Common Mistakes:

• Choosing the highest cost link
• Assuming equal load on all links
• Ignoring cost metric in path selection

4. A network administrator notices that OSPF is not updating routes after a link failure. What is the most likely cause?

medium

A. The router has too many static routes configured

B. The router is not sending Link State Advertisements (LSAs)

C. The router is using RIP instead of OSPF

D. The router's IP address is incorrect

Solution

1. Step 1: Identify OSPF update mechanism

   OSPF updates routes by sending LSAs to inform all routers about changes.

2. Step 2: Analyze failure cause

   If routes are not updating after a link failure, it likely means LSAs are not being sent properly.

3. Final Answer:

   The router is not sending Link State Advertisements (LSAs) -> Option B

4. Quick Check:

   No LSAs = no route updates [OK]

Hint: No LSAs means no route updates [OK]

Common Mistakes:

• Blaming static routes for OSPF updates
• Confusing OSPF with RIP protocol
• Assuming IP address errors cause routing updates

5. In a large OSPF network, how does dividing the network into areas improve routing efficiency?

hard

A. By limiting the scope of link state updates to within each area

B. By allowing routers to ignore all link state information

C. By forcing all routers to maintain a full map of the entire network

D. By disabling route calculation on some routers

Solution

1. Step 1: Understand OSPF area concept

   Dividing a network into areas limits the size of link state databases each router must maintain.

2. Step 2: Explain efficiency gain

   This reduces the amount of link state updates routers process, improving speed and reducing resource use.

3. Final Answer:

   By limiting the scope of link state updates to within each area -> Option A

4. Quick Check:

   Areas limit update scope = better efficiency [OK]

Hint: Areas limit updates to improve efficiency [OK]

Common Mistakes:

• Thinking routers ignore link state info
• Assuming all routers keep full network maps
• Believing route calculation is disabled