1

Comparative Analysis of LS and DV Routing Algorithms: BGP Applications and OSPF

Configuration

Neera Gurung

Department of Information and Technology, International American University

CSE 115: Computer Networking

Professor Subekshya Pradhan

10 June 2025
 2

Distance-Vector (DV) Routing Algorithm

Introduction

Distance-Vector (DV) algorithms, for example, RIP (Routing Information Protocol),

decide on the best way to get to a specific place by taking the shortest path and next router in

that path. Routers transfer the full details of their routing table to other routers and this allows

solution calculation to be decentralized (Kurose & Ross, 2021).

Advantages

1. Low Resource Requirements

Using RIP as an example, DV protocols are easy on both the CPU and

memory as they do not have to save the whole network map (Kurose & Ross,

2021). For this reason, they fit in devices that do not require much power.

2. Easy Configuration and maintenance

Because most changes are not as frequent, DV protocols are simple to set up

in small networks (Huitema, 2000).

3. Predictable Behaviour in Stable Networks

When the topology in a network changes infrequently, DV algorithms use

little extra overhead (Tanenbaum & Wetherall, 2013).

Disadvantages

1. Slow convergence and & Routing Loops

Given the updates and a cyclic issue, DV protocols have difficulties handling

network failures and can generate black holes for a while (as cited in Doyle &

Carroll, 2005).

2. Bandwidth Inefficiency

In big networks, too much bandwidth is consumed since routing tables are

swapped more often than they need to be (Moy, 1998).

 3

3. Lack of Global Network View

Since they use data from nearby routers, routers might choose bad routes for

packets (Griffin & Wilfong, 2002).

Link-State (LS) Routing Algorithm

Introduction

Because of OSPF (Open Shortest Path First) and similar algorithms, each router must

keep a record of all other routers in the network. All link-state advertisements (LSAs) are

broadcast by routers to all the nodes, so Dijkstra’s algorithm is able to determine the shortest

path to each destination (Moy, 1998).

Advantages

1. Fast Convergence and Loop Prevention

With triggered updates and Dijkstra’s algorithm, OSPF provides a quick way

to adjust the routing system following topology changes, avoiding any loops

(Moy, 1998).

2. Optimal Path Calculation

Keeping a complete topology map, each router is able to make smart decisions

about how data is routed (Tanenbaum & Wetherall, 2013).

3. Hierarchical Design for Scalability

A hierarchical structure makes it possible for LS protocols to handle vast

networks by lessening the burden in large-scale operations (Doyle & Carroll,

2005).

Disadvantages

1. High CPU and Memory Usage

Because it needs a lot of resources, LS protocols are not very suitable for

devices with limited abilities (Kurose & Ross, 2021).

 4

2. Complex Configuration

To deploy LS effectively, you have to set up timers, areas, and throttle the

LSA traffic (Moy, 1998).

3. Initial Flooding overhead

When a router connects to a network, its LS database is synchronized and this

causes a temporary rise in traffic (Huitema, 2000).

How BGP is used in Real Life?

BGP, which underpins the Internet, uses a path-vector method (just like Interior

Gateway Protocol), but also includes features found in LS. differential routers, unlike

traditional ones, use BGP and its fully detailed path information to steer clear of loops

(Rekhter et al., 2006).

Analysis of real-world BGP use:

● DV Influence: Path attributes are added to the gradual sharing of routing data in

BGP, just as with DV (Rekhter et al., 2006).

● LS influence: BGP policies help ASes set route preferences in a manner similar to

how LS knows its primitive organization (Griffin & Wilfong, 2002).

● Hybrid efficiency: BGP combines the good points of DV and LS, allowing it to route

between different networks with ease (Kurose & Ross, 2021).

 5

2. Configure OSPF in a simple network topology in Packet Tracer. The student must

provide a screenshot of the OSPF configuration and explain it.

Answer:

Explanation of Network Topology

● Two routers called NEERA-R1 and NEERA-R2 are present, and they link together

two end devices, which are NEERA-PC1 and NEERA-PC2, while intermediary

switches NEERA-S1 and NEERA-S2 are in between the routers.

● NEERA-PC1 uses an address from the network 192.168.1.0/26 and reaches the wider

network through Router NEERA-R1.

● NEERA-PC2 is situated in a subnet called 192.168.1.64/27 that connects to Router

NEERA-R2.

● NEERA-R1 and NEERA-R2 can directly exchange information only using the

192.168.1.96/30 network.

● Using FastEthernet (Fa0/x) interfaces, all the interconnections are in use.

● OSPF (Open Shortest Path First) is used by these routers as their routing protocol so

that routes can be shared smoothly between networks.

 6

Routing table of Router NEERA-R1 (Screenshot):

Routing table of Router NEERA-R2 (Screenshot):

OSPF routing on router NEERA-R1 (Screenshot):

 7

Explanation of Key Commands:

Router ospf 1

With this command, you turn on OSPF on the router and label the process as 1 for

identification. Different routers do not need to give process IDs the same number, only

matching the IDs on their own router is enough.

Passive-interface Fast Ethernet0/0

These hello packets are blocked from going out on interfaces where OSPF is not needed, for

example, those that are attached to PCs. It makes places safer and eases traffic on the roads.

Network 192.168.1.0 0.0.0.255 area 0

This command tells the router to enable OSPF on the interface that belongs to the 192.168.1.0

network. The wildcard mask 0.0.0.63 allows it to match the subnet. The interface is

placed in area 0, which is the backbone area of OSPF and mandatory for OSPF to function

properly.

Conclusion

Both routers are able to share routing data because the OSPF configuration is in place in this

network. Even though the commands are simple, they play a vital role for any network

technician. Managing ospf, passive-interface, and network area 0 is important for building a

good awareness of OSPF and routing in general.

 8

References

Doyle, J., & Carroll, J. (2005). Routing TCP/IP, Volume 1 (2nd ed.). Cisco Press.

Griffin, T., & Wilfong, G. (2002). Analysis of the MED Oscillation Problem in BGP. IEEE

ICNP.

Huitema, C. (2000). Routing in the Internet (2nd ed.). Prentice Hall.

Kurose, J. F., & Ross, K. W. (2021). Computer Networking: A Top-Down Approach (8th

ed.). Pearson.

Moy, J. (1998). OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley.

Rekhter, Y., Li, T., & Hares, S. (2006). A Border Gateway Protocol 4 (BGP-4). RFC 4271.

Tanenbaum, A. S., & Wetherall, D. J. (2013). Computer Networks (5th ed.). Pearson.

Cisco. (n.d.). Configure OSPF routing - Cisco Packet Tracer labs. Retrieved from

https://www.cisco.com

Odom, W. (2020). CCNA 200-301 Official Cert Guide, Volume 1. Cisco Press.
9