Distance vector routing (RIP) in Computer Networks - Time & Space Complexity

Time Complexity: Distance vector routing (RIP)

O(n^2)

Understanding Time Complexity

When studying Distance Vector Routing, it is important to understand how the routing updates scale as the network grows.

We want to know how the time to update routing tables changes when more routers join the network.

Scenario Under Consideration

Analyze the time complexity of the routing update process in RIP.

for each router in network:
    for each neighbor of router:
        send routing table to neighbor
    for each entry in routing table:
        update distance if better path found
    wait for next update interval
    

This code shows how each router sends its routing table to neighbors and updates its own table based on received information.

Identify Repeating Operations

Look at what repeats during the routing update process.

• Primary operation: Each router sends its routing table to all neighbors and updates its table entries.
• How many times: For each router, this happens once per update interval, and involves checking all neighbors and all routing entries.

How Execution Grows With Input

As the number of routers (n) increases, each router has more neighbors and more routing entries to process.

Input Size (n)	Approx. Operations
10	About 10 routers x neighbors x 10 entries
100	About 100 routers x neighbors x 100 entries
1000	About 1000 routers x neighbors x 1000 entries

Pattern observation: The work grows roughly with the square of the number of routers because each router processes information about many others.

Final Time Complexity

Time Complexity: O(n^2)

This means the time to update routing tables grows roughly with the square of the number of routers in the network.

Common Mistake

[X] Wrong: "The update time grows linearly with the number of routers because each router only sends updates once."

[OK] Correct: Each router must process routing information about many others, so the total work grows faster than just the number of routers.

Interview Connect

Understanding how routing protocols scale helps you think clearly about network performance and design, a useful skill in many technical roles.

Self-Check

"What if routers only sent updates when their routing tables changed? How would that affect the time complexity?"

Practice

1. What is the main metric used by Distance Vector Routing Protocol (RIP) to determine the best path?

easy

A. Hop count

B. Bandwidth

C. Delay

D. Cost

Solution

1. Step 1: Understand RIP metric

   RIP uses hop count as the metric to measure the distance to a destination network.

2. Step 2: Compare with other metrics

   Other protocols may use bandwidth, delay, or cost, but RIP specifically uses hop count.

3. Final Answer:

   Hop count -> Option A

4. Quick Check:

   RIP metric = Hop count [OK]

Hint: RIP counts hops, not speed or delay [OK]

Common Mistakes:

• Confusing hop count with bandwidth
• Thinking RIP uses delay as metric
• Assuming cost is used in RIP

2. Which of the following is the correct way RIP routers share their routing information?

easy

A. Routers send their entire routing table to neighbors periodically

B. Routers send only changed routes immediately

C. Routers broadcast only the best route to each destination

D. Routers send routing updates only when a link fails

Solution

1. Step 1: Recall RIP update method

   RIP routers send their full routing tables to all neighbors at regular intervals.

2. Step 2: Contrast with other methods

   Other protocols may send only changes or triggered updates, but RIP sends full tables periodically.

3. Final Answer:

   Routers send their entire routing table to neighbors periodically -> Option A

4. Quick Check:

   RIP sends full tables periodically [OK]

Hint: RIP sends full tables regularly, not just changes [OK]

Common Mistakes:

• Thinking RIP sends only changed routes
• Assuming RIP uses triggered updates only
• Believing RIP sends partial route info

3. Consider a RIP network where Router A has routes: Network X (2 hops), Network Y (3 hops). Router B receives this info and has Network X (1 hop), Network Y (4 hops). After update, what is Router B's hop count to Network Y?

medium

A. 3 hops

B. 2 hops

C. 5 hops

D. 4 hops

Solution

1. Step 1: Understand RIP update rule

   Router B updates routes by adding 1 hop to neighbors' hop counts.

2. Step 2: Calculate new hop count for Network Y

   Router A reports 3 hops to Network Y, so Router B's new cost is 3 + 1 = 4 hops. But Router B already has 4 hops, so it keeps 4 hops.

3. Step 3: Check if better route exists

   Router B's own route is 4 hops, neighbor's route plus 1 is also 4 hops, so it keeps 4 hops.

4. Final Answer:

   4 hops -> Option D

5. Quick Check:

   Neighbor hops + 1 = 4 hops [OK]

Hint: Add 1 hop to neighbor's count, pick smallest [OK]

Common Mistakes:

• Forgetting to add 1 hop to neighbor's count
• Choosing neighbor's hop count without adding 1
• Ignoring existing route cost

4. A RIP router is not updating its routing table correctly and keeps old routes indefinitely. What is the most likely cause?

medium

A. The router has a maximum hop count set too high

B. The router is using link-state routing instead of distance vector

C. The router is not receiving periodic updates from neighbors

D. The router is sending triggered updates too frequently

Solution

1. Step 1: Identify update mechanism in RIP

   RIP relies on periodic updates from neighbors to refresh routing tables.

2. Step 2: Analyze symptom

   If the router keeps old routes indefinitely, it likely isn't receiving these updates.

3. Final Answer:

   The router is not receiving periodic updates from neighbors -> Option C

4. Quick Check:

   No updates received = stale routes [OK]

Hint: No updates received means routes never refresh [OK]

Common Mistakes:

• Confusing routing protocol type
• Thinking hop count setting causes stale routes
• Assuming triggered updates cause stale routes

5. In a network using RIP, a router receives two routes to the same destination: one with 3 hops via Router X and another with 3 hops via Router Y. Which route will RIP choose and why?

hard

A. The route learned first, because RIP prefers the earliest route

B. Either route, because RIP considers equal hop counts as equal cost

C. The route with the lowest IP address of the next hop router

D. The route with the highest bandwidth link

Solution

1. Step 1: Understand RIP route selection

   RIP selects routes based on hop count; if multiple routes have the same hop count, they are considered equal cost.

2. Step 2: Analyze tie-breaking in RIP

   RIP can load balance across equal-cost routes or pick any; it does not prefer based on IP or bandwidth.

3. Final Answer:

   Either route, because RIP considers equal hop counts as equal cost -> Option B

4. Quick Check:

   Equal hops = equal cost, any route chosen [OK]

Hint: Equal hops mean equal cost; RIP can use either route [OK]

Common Mistakes:

• Assuming RIP prefers first learned route
• Thinking RIP uses next hop IP to decide
• Believing RIP considers bandwidth in route choice