Computer Network

Distance Vector protocol

Bellman Ford Algorithm

Matrix is Hops and Maximum Hop count is 15. 16 is unreachable

To privent looping it uses Maximum hop count, Route poisoning and spit horizon

Administrative Distant for RIP is 120

Update Time 30s

Invalid Time is 180s

Hold down time 180s

Flush time 240s

Rip 1

Rip 1 is class full

No VLSM

RIP2

Rip 2 is class less and

support VLSM

Manual route summarization

RIPng has to enable in every interface.

Configuration on RIP

Router(config)#router rip

Router(config-router)#version 2

Router(config-router)#network 0.0.0.0

Verifying Commands

Router#show ip protocols

Router#show ip route

Router#debug ip rip

Router(config)#ip route 192.168.100.0 255.255.255.0 192.168.1.2

192.168.100.0 = destination network

255.255.255.0 = subnet mask

192.168.1.2 = next-hop address

Router(config)#ip route 192.168.100.0 255.255.255.0 s0/0

192.168.100.0 = destination network
255.255.255.0 = subnet mask
s0/0 = exit interface

	Rip1	RIP2	IGRP	EIGRP	OSPF
Standard			CISCO Preparatory	CISCO Preparatory	Open
Routing / Routed	Routing		Routing	Routing	Routing	IS-IS Routing IP Routed
ERP / IRP	IRP		IRP	IRP	IRP	ERP (BGP)
Three Classes	Distance Vector		Distance Vector	Hybrid	Link state	IS-IS Link state
Classless VLMS / Classful No VLMS	No VLMS	VLMS	No VLMS	VLMS	VLMS
Administrative distance (AD)	120		100	90	110
Matrix	Hops		bandwidth and delay	bandwidth and delay	bandwidth
Maxima Hops	15		255
Algorithm	Bellman Ford			Diffusing Update(DUAL)	Dijkstra
Update Time	30		90		10-Hello
					224.0.0.5
Invalid Time	180		270		40-ded
Hold down Time	180		280		No
Flush	240		630		No
	1 Maximum Hops 2 Spit Horizon 3 Rout Poisoning			Hello and ACK As Number match Identical Matr(K value)	Hello àNeighbor LSAàTopology DB

Pages