Distance Vector Routing
Introduction to Distance Vector Routing
Distance vector routing is a type of
routing protocol used in computer
networks to determine the best path
for data.
It relies on each router sharing its
routing table with its immediate
neighbors periodically.
This method helps routers learn about
network topology dynamically and
efficiently.
1
Basic Principles of Distance Vector Routing
Routers maintain a table that contains
the distance to every possible
destination in the network.
Distance is typically measured in hop
count, but can also include metrics
like delay or bandwidth.
Routers update their tables based on
information received from neighbors,
aiming to find the shortest path.
2
How Distance Vector Routing Works
Each router periodically broadcasts its
routing table to neighboring routers.
Upon receiving updates, routers
adjust their tables if a shorter path is
discovered.
This process continues until all routers
have consistent and optimal routing
information.
3
Key Algorithms – Bellman-Ford Algorithm
The Bellman-Ford algorithm calculates
the shortest path by iteratively
updating distances based on
neighbors' information.
It is fundamental to many distance
vector protocols like RIP.
The algorithm can handle networks
with some changes, such as link
failures, by recalculating routes.
4
Routing Protocols Using Distance Vector
Routing Information Protocol (RIP) is
the most common protocol based on
distance vector principles.
RIP uses a maximum hop count of 15
to prevent routing loops and limit
network size.
Other protocols include IGRP (Interior
Gateway Routing Protocol), which
offers enhancements over RIP.
5
Advantages of Distance Vector Routing
It is simple to implement and requires
minimal computational resources.
Routers can quickly adapt to changes
in network topology through regular
updates.
It is suitable for small to medium-
sized networks with relatively simple
routing needs.
6
Disadvantages of Distance Vector Routing
It is susceptible to routing loops,
which can cause temporary routing
issues.
Convergence can be slow, leading to
inconsistent routing tables during
network changes.
The protocol can generate excessive
routing updates, consuming
bandwidth unnecessarily.
7
Common Issues – Count to Infinity and Routing
Loops
The "count to infinity" problem occurs
when incorrect routing information
propagates, delaying network
convergence.
Routing loops happen when data
packets circulate endlessly due to
inconsistent routing tables.
Techniques like split horizon and hold-
down timers are used to mitigate
these issues.
8
Improvements and Alternatives
Link-state routing protocols, such as
OSPF, offer faster convergence and
better scalability.
Hybrid protocols combine aspects of
distance vector and link-state
methods for improved performance.
Network administrators choose
protocols based on network size,
complexity, and specific
requirements.
9
Conclusion and Summary
Distance vector routing is a
fundamental method for dynamic
routing in computer networks.
It is easy to implement but has
limitations like slow convergence and
vulnerability to loops.
Understanding its principles helps in
designing efficient and reliable
network routing strategies.
10