Distance Vector Routing Protocols: Khawar Butt Ccie # 12353 (R/S, Security, SP, DC, Voice, Storage & Ccde)

A distance vector routing protocol communicates with neighboring routers to share routing information. It informs neighbors of all routes and the cost to reach destinations. Routers choose the best path based on the lowest cost advertised without seeing the full topology. Examples of distance vector protocols are RIP versions 1 and 2, IGRP, and EIGRP.

Uploaded by

Avishkar Gote

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

88 views7 pages

Distance Vector Routing Protocols: Khawar Butt Ccie # 12353 (R/S, Security, SP, DC, Voice, Storage & Ccde)

Uploaded by

Avishkar Gote

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 7

Distance Vector Routing c

Protocols
KHAWAR BUTT
CCIE # 12353 [R/S, SECURITY, SP, DC, VOICE, STORAGE & CCDE]
Overview
 Distance Vector Routing Protocol Characteristics
 Examples of Distance Vector Routing Protocols
c
Lab Diagram
192.168.1.0/24 192.168.3.0/24

E 0/0 E 0/0
Serial 1/0 192.168.13.0/24
R1 Serial 1/0
c R3
Serial 1/1 Serial 1/1

192.168.12.0/24 192.168.23.0/24

Serial 1/0 Serial 1/1

R2 E 0/0
192.168.2.0/24
E 0/1

192.168.24.0/24

E 0/0
E 0/1
R4 192.168.4.0/24
Distance Vector Routing Protocol
Characteristics
 A distance vector routing protocol communicates to other routers that are directly to it.

 It will inform its neighboring router about all the routes it is aware of and the Cost/Metric to reach
the destination network thru it. c
 The receiving router might have learnt about the same route from another Neighbor. It will compare
the Cost/Metric advertised by the 2 routers and pick the better metric [Lower Cost or Distance].

 The receiving router does not see the entire topology. He is aware of a particular network and which
is the best path to the distance.

 In the Lab Diagram, R1 will learn about the 192.168.4.0/24 network from R2 & R3. R1 will not know
that it is connected to R4. It will know the cost of reaching 192.168.4.0/24 network via R2 and R3. It
will pick the best route based on the Lowest Metric/Cost.
Distance Vector Routing Protocol
Characteristics
 Metric used to determine the best route is either the speed, delay(latency) or distance.

 Some Distance Vector routing protocols will use distance as the only criteria to determine the
best route. c

 In the Lab Diagram if the routing protocol was using distance as a metric, R1 would pick the
Route via R2 as the best route as it only needs to cross 2 routers/hops to get to
192.168.4.0/24 whereas it would cost to reach 192.168.4.0/24 via R3 would be 3
routers/hops. This might not be the fastest path but it is the shortest path.

 Some Distance Vector routing protocols will use Speed or Delay of an interface as a
measuring stick to figure out the best route. This type of protocol would analyze the best
path based on the speeds of the links.
Distance Vector Routing Protocol
Examples
 RIP Version 1 – Initial implementation of a Distance Vector Routing
Protocol.
 RIP Version 2 – Current implementation of RIP. It provided a lot of
c
additional capabilities that RIP version 1 lacked. We will discuss them in the
RIP Module/Video.
 IGRP – Interior Gateway Routing Protocol (IGRP) was a Cisco Proprietary
protocol. It would only work on Cisco Routers as a Distance Vector Protocol.
 EIGRP – Enhance Interior Gateway Routing Protocol (EIGRP) was initially a
Cisco Proprietary protocol that was set as an Open Standard protocol by
Cisco later on. It is an advanced Distance Vector Routing Protocol.
Whiteboard