1
X Y
DISTANCE VECTOR ROUTING
1. Introduction
5 2
Routing is the process of selecting the best path for transmitting data packets across computer networks. Distance
Vector Routing is a routing algorithm in which routers exchange routing information with neighboring routers to
determine the shortest path to a destination. The algorithm uses the Bellman-Ford algorithm to calculate routes.
Z
Figure 1: Network Topology and Link Costs
2. Initial Distance Vectors
Initially, routers only know the distance to themselves and directly connected neighbors.
Router Distance Vector
X (0,1,5)
Y (1,0,2)
Z (5,2,0)
3. Bellman-Ford Algorithm
The Bellman-Ford algorithm forms the foundation of Distance Vector Routing. Each router calculates the shortest path
by adding the cost to a neighboring router to the neighbor’s known distance to a destination. For example, router X
initially believes the shortest path to Z is 5. After receiving routing information from router Y, router X discovers a
shorter path X → Y → Z with a total cost of 3.
4. Bellman-Ford versus Dijkstra Algorithm
Bellman-Ford is used in Distance Vector Routing protocols such as RIP, while Dijkstra is used in Link State Routing
protocols such as OSPF. Bellman-Ford relies on periodic exchange of routing tables, whereas Dijkstra requires
routers to maintain a complete map of the network topology.
Feature Bellman-Ford Dijkstra
Routing Type Distance Vector Link State
Convergence Slower Faster
Knowledge Neighbors Only Complete Topology
Example RIP OSPF
5. Convergence Behaviour
Convergence refers to the process by which all routers obtain accurate routing information. Distance Vector Routing
converges slowly because updates are exchanged periodically. When failures occur, routers may continue sharing
incorrect information, resulting in the count-to-infinity problem.
6. Update Mechanisms
Distance Vector protocols use periodic updates. RIP sends updates every 30 seconds. Mechanisms such as split
horizon, route poisoning, and hold-down timers help reduce routing instability.
7. Real-World Routing Protocols
RIP is a simple Distance Vector Routing protocol suitable for small networks. EIGRP is an advanced Cisco routing
protocol that converges faster and supports larger enterprise networks. OSPF is a Link State Routing protocol that
uses Dijkstra’s algorithm and is suitable for large-scale networks.
8. Suitable Use Cases
Distance Vector Routing is best suited for small networks because of its simplicity and low resource requirements.
Large enterprise networks require faster convergence and scalability, making OSPF more suitable.
9. Conclusion
Distance Vector Routing is an important routing technique that allows routers to exchange routing information and
determine shortest paths. Although simple and easy to implement, it converges slowly during failures. Protocols such
as RIP, EIGRP, and OSPF demonstrate how routing algorithms are used in modern networks.