Routing Information Protocol(RIP)

Definition of routing information protocol, Routing information protocol versions, Features of routing information protocol, Routing information protocol updating algorithm, Ring topology, Command line interface code

1. PRESENTED BY
PRESENTED TO
TEACHER’S NAME

2. Theory
Detail’s
Introduction topology
IpConfiguration
CLI
PROJECTS CONTENTS

3. Routing Information Protocol(RIP)is a
dynamic routing protocol which uses hop
count as a routing metric to find the best path
between the source and the destination
network.
DEFINITION:

4. Based on distance vector routing
Used inside an autonomous system
Cost of metric is hop count
Network cannot have more than 15 hops

5. There are two versions of routing information
protocol.
oRIP Version1
oRIP Version2

6. RIP v2is known
asClasslessRouting
Protocol.
It has ability to carry
subnet information.
support authentication
and does sub netting
and multicasting
RIP v1is known
asclassfulRouting
Protocol.
Updates are
broadcasted.
administrative distance
value is 120

7. 1.Updates of the network are exchanged
periodically.
2.Updates (routing information) are always
broadcast.
3.Full routing tables are sent in updates.
4.Routers always trust on routing information
received from neighbor routers. This is also
known asrouting on rumors.

8. Receive: a response RIP message
1. Add one hop to the hop count for each advertised destination.
2. Repeat the following steps for each advertised destination:
1. If (destination not in the routing table)
Add the advertised information to the table.
2. Else
1. If (next-hop field is the same)
Replace entry in the table with the advertised one.
2. Else
1. If (advertised hop count smaller than one in the table)
Replace entry in the routing table.
3. Return.

12. BEFORE AFTER