Link state routing (OSPF) in Computer Networks - Mini Project: Build & Apply

Understanding Link State Routing with OSPF

📖 Scenario: You are a network engineer learning how routers use the OSPF (Open Shortest Path First) protocol to find the best path in a network. OSPF uses link state routing, where each router knows the state of its links and shares this information with others.Imagine a small network of routers connected by links with different costs. Your task is to understand how OSPF builds a map of the network and calculates the shortest path.

🎯 Goal: Build a simple representation of a network's link states, configure a cost threshold, apply the OSPF link state routing logic to find reachable routers within the cost limit, and finalize the routing table.

📋 What You'll Learn

Create a dictionary representing routers and their link costs to neighbors

Add a cost threshold variable to limit path costs

Implement logic to find routers reachable within the cost threshold using link state routing principles

Complete the routing table with the final reachable routers and their costs

💡 Why This Matters

🌍 Real World

Network engineers use OSPF to efficiently route data in large networks by sharing link state information and calculating shortest paths.

💼 Career

Understanding OSPF and link state routing is essential for roles in network administration, network engineering, and IT infrastructure management.

1

Create the network link state data

Create a dictionary called link_states that represents the network. Use these exact entries: 'R1': {'R2': 10, 'R3': 20}, 'R2': {'R1': 10, 'R4': 15}, 'R3': {'R1': 20, 'R4': 30}, 'R4': {'R2': 15, 'R3': 30}.

Computer Networks

# Create the link_states dictionary with the given router connections and costs
# Your code here

Hint

Think of link_states as a map where each router lists its neighbors and the cost to reach them.

2

Set the cost threshold for reachable routers

Create a variable called cost_threshold and set it to 25. This will limit the maximum cost to reach other routers.

Computer Networks

link_states = {
    'R1': {'R2': 10, 'R3': 20},
    'R2': {'R1': 10, 'R4': 15},
    'R3': {'R1': 20, 'R4': 30},
    'R4': {'R2': 15, 'R3': 30}
}
# Set the cost_threshold variable to 25
# Your code here

Hint

The cost_threshold helps decide which routers are reachable within a certain cost limit.

3

Find reachable routers within the cost threshold

Create a dictionary called reachable_routers. Use a for loop with variables neighbor and cost to iterate over link_states['R1'].items(). Add neighbors to reachable_routers only if their cost is less than or equal to cost_threshold.

Computer Networks

link_states = {
    'R1': {'R2': 10, 'R3': 20},
    'R2': {'R1': 10, 'R4': 15},
    'R3': {'R1': 20, 'R4': 30},
    'R4': {'R2': 15, 'R3': 30}
}
cost_threshold = 25
# Create reachable_routers dictionary and add neighbors within cost_threshold
# Your code here

Hint

Use a loop to check each neighbor's cost and add only those within the threshold to reachable_routers.

4

Complete the routing table with reachable routers

Create a dictionary called routing_table and set it equal to reachable_routers. Then add an entry for 'R1' with cost 0 to represent the current router.

Computer Networks

link_states = {
    'R1': {'R2': 10, 'R3': 20},
    'R2': {'R1': 10, 'R4': 15},
    'R3': {'R1': 20, 'R4': 30},
    'R4': {'R2': 15, 'R3': 30}
}
cost_threshold = 25
reachable_routers = {}
for neighbor, cost in link_states['R1'].items():
    if cost <= cost_threshold:
        reachable_routers[neighbor] = cost
# Create routing_table from reachable_routers and add 'R1' with cost 0
# Your code here

Hint

The routing table shows the cost to reach each router including the current one with cost zero.

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