An adaptive or dynamic programming. Sometimes called Belman Ford Routing Algorithm

1. GROUP- ‘অ’
GROUP MEMBERS ID
Md. Nurul Alam 1511971042
Sazidur Rahman Bhuiyan 1511672042
Md. Nazmul Hasan 1512054042
TOPIC: DISTANCE VECTOR ROUTING (DVR)

2. Distance Vector Routing
1. It’s an adaptive or dynamic programing
2. Each router maintains a table called “vector”
3. Table has best known distance for each router
4. Tables are updated by exchanging information with neighbours(Routers)
5. Each router knows the best distance to reach another router
6. Also known as Bellman-Ford Routing Algorithm.

3. Distance Vector Routing
Each Router’s Table has one entry for one router :
This entry has two parts
1. Preferred outgoing line for each Router
2. Estimated distance to destination Router
Distance is basically considered by number of Hops.
Delays basically measured by sending ECHO packets to another
routers.

4. Distance Vector Routing
A C DB
E F G H
LKJI
EA
8
EI
10
EF
12
EC
6

5. The Count to Infinity Problem

6. Thank You