Scribd
Upload
12 views3 pages

Distance Vector Routing Overview

Distance vector (DV) routing protocols like RIP broadcast full routing tables periodically, wasting bandwidth resources. They also have limited routing tables and use only hop count to determine best paths. DV protocols support features like split horizon, poison reverse, and equal cost load balancing. Authentication can be configured using clear text or MD5 keys to secure routing updates.

Uploaded by

Amin Faozi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views3 pages

Distance Vector Routing Overview

Distance vector (DV) routing protocols like RIP broadcast full routing tables periodically, wasting bandwidth resources. They also have limited routing tables and use only hop count to determine best paths. DV protocols support features like split horizon, poison reverse, and equal cost load balancing. Authentication can be configured using clear text or MD5 keys to secure routing updates.

Uploaded by

Amin Faozi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

DISTANCE VECTOR ROUTING

When to Use DV Routing

DV usually used on LAN.


Work well in smaller and more stable environments.

The Drawbacks :
- RIP broadcast routing updates every 30 seconds and IGRP every 90 seconds.
- Both will broadcast full routing tables as part of their update. => waste of bandwidth and resources.
- RIP routing update only can hold maximum of 25 routes. => if there is 105 routes, 5 separate updates would be
needed.
- Classfull routing protocol, don't support VLSM.
- Choose best path based on hop count.

DV used 4 path for equal cost load balancing by default(max 6).

Split Horizon

Routing Protocol cant advertise the route via the same interface upon which the route learned on.

Poison Reverse

Allow a router to advertise a network with a metric unreachable when the network becomes unavailable.
RIPv1 RIPv2

Broadcast every 30s to [Link] Multicast every 30s to [Link]


Classfull Classless
Update contain entire routing table << same
Bellman-Ford Algorithm << same
Max hop count = 15 << same
Allow equal cost load balancing << same
Doesn't support clear text or md5 authentication Support clear text or md5 authentication
Updates carry 25 routes max << same

IGRP EIGRP

Broadcast every 90s to [Link] Multicasts full routing tables only at first [Link]
Cisco proprietary << same
Classfull Classless
Update contains entire routing table Update only when there is a change in topology
Bellman-Ford Algorithm DUAL routing algorithm
Unequal-cost load sharing enabled with variance command << same

Routing Process:

1. If there are multiple routes to a destination, the route with the longest prefix length is used.
2. If there are multiple routes to a destination and they have the same prefix length, the route with the lowest AD is
used.
3. If there are multiple routes with the same prefix length and AD, the route with the lowest metric is used.
4. If there are multiple routes with the same prefix length, AD, and metric, all of these routes will be used in load
balancing as allowed by the protocol.

Authentication

R1(config)#key chain RIP


R1(config-keychain)#key 1
R1(config-keychaing-key)#key-string CISCO

R1(config)#int s0
R1(config-if)#ip rip authentication mode text
R1(config-if)#ip rip authentication key-chain RIP
R1#debug ip rip => klo 1 pake text, 1 lagi pk md5, bisa mismatch juga

R1(config-router)#passive-interface serial0 <<gak kirim update ke semua ruter


Gimana klo mo kirim ke R3 tapi gak mo ke R2?
R1(config-router)#neighbor [Link] << R3

You might also like