distance vector routing

1. BG
RAJOURI.
Presentation Topic:-
DISTANCE VECTOR ROUTING
Presented By:-
Name: LUCKY
Department: (Computer science)
Roll No: -MCS-2015

2. Routing
• Routing is the process of selecting best paths in
a network.
• Routing is the process of forwarding of a packet in
a network so that it reaches its intended destination.
• Routing is the process of moving packets across
a network from one host to a another.
Routing Is Of Two Types:-
1-Static Routing.
2-Dynamic Routing.

3. INTRODUCTION
• STATIC ROUTING:- in static routing method ,routing tables
are manually configured by the network administration.
• Static routing is used in smaller networks that contain only a
smaller no. of routers or where security is a major concern.
• Routers that use static routing are called static routers.
• Each static router must be configured and maintained
separately because static routers do not exchange routing
information with each other.
• DYNAMIC ROUTING:- dynamic routing is a routing
mechanism which is handled by routing protocols such as
routing information protocol(RIP) open shortest path first
(OSPF) protocol, etc .
• These protocols dynamically exchange routing information
among routers on an internetwork.
• Routers that use these methods are called dynamic routers.
• Dynamic routers are less secure.

4. DISTANCE VECTOR ROUTING
(SHORTEST PATH ROUTING)
• Distance vector routers advertise their presence
to all routers on the network. Each router on the
network broadcasts time to time the
information in its routing table .
• Other routers can use this information to update
their own router tables.
• In distance vector routing, the least-cost route
between any two nodes is the route with
minimum distance.

5. • In this protocol, as the name implies, each node
maintains a vector (table) of minimum distances
to every node.
• The table at each node also guides the packets to
the desired node by showing the next stop in the
route (next-hop routing).
• We can think of nodes as the cities in an area and
the lines as the roads connecting them.
A table can show a tourist the minimum
distance between cities.
In Figure 1 we show a system of five nodes with
their corresponding tables.

6. Figure 1). Distance vector routing table
The table for node A shows how we can reach any node from this
node. For example,
our least cost to reach node E is 6. The route passes through C.

7. To AllOf You...
Thanks