Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 18

ROUTING INFORMATION

PROTOCOL (RIP)
PRESENTED BY SIKANDAR FARID
ROLL NUMBER 1523006 (06)
BS IT 2ND BATCH
INSTRUCTOR: MR. UMAR ALI
ROUTING

Static • Predefined path set by administrator


Routing
Dynamic • Defined by routing protocols
Routing
DYNAMIC ROUTING

• Interior Gateway Protocols (IGP)


• These protocols are used to exchange routing information within an autonomous
system. (also called intra-domain routing)
• Like Distance Vector and Link State

• Exterior Gateway Protocols (EGP)


• They are used for routing between autonomous systems. (also called inter-domain
routing)
• Like BGP (Border Gateway Protocol)
INTERIOR GATEWAY PROTOCOLS
(IGP)
• Distance Vector
• Each router periodically shares its knowledge about the entire internet
with its neighbor.

• Link State
• Triggered updates
DISTANCE VECTOR

• Distance Vector Protocols

• RIP (Routing Information Protocol)

• IGRP (Interior Gateway Routing Protocol)


LINK STATE

• Link State Protocols

• OSPF (Open Shortest Path First)


• IS-IS (Intermediate System to Intermediate System)

• Hybrid: EIGRP (Distance Vector + Link State Properties)


ROUTING INFORMATION PROTOCOL
(RIP)

• RIP was first developed in 1969 as a part of ARPANET.


• It is a distance-vector protocol, which employs Hop Count as the
metric.
• The maximum number of hops allowed with RIP (version 1) is 15.
• It runs above Network layer of the Internet protocol suite, using
UDP port 520 to carry its data.
ROUTING INFORMATION PROTOCOL
(RIP)
• Each node calculates the distances between itself and all other
nodes within the AS and stores this information as a table.
• Each node sends its table to all neighboring nodes.
• When a node receives distance tables from its neighbors, it
calculates the shortest routes to all other nodes and updates its
own table to reflect any changes.
• A router advertisements every 30 seconds.
ROUTING INFORMATION PROTOCOL
(RIP)
• Each message consists of pairs, where each pair contains an IP
network address and an integer distance to that network.
• All nodes listen to the advertisements and updates their route
tables.
• The information is stored in a RIP routing table.
• When network topology changes occur, they are reflected in
routing update messages.
RIP TIMERS

• RIP uses certain timers to regulate its performance.


• The routing-update timer clocks the interval between periodic
routing updates, each router periodically transmits it entire routing
table to all the other routers on the network each 30 seconds.
• This is controlled by the route invalid timer (or route-timeout
timer), which determines how much time must expire without a
router having heard about a particular route before that route is
considered invalid.
RIP TIMERS

• Each routing table entry has a route-timeout timer associated with


it.
• When the route-timeout timer expires, the route is marked invalid
and neighbors are notified of this fact.
• Typical initial value of route invalid timer is 90 seconds.
HOP-COUNT LIMIT
• RIP prevents routing loops from continuing indefinitely by
implementing a limit on the number of hops allowed in a path
from the source to a destination.
• The maximum number of hops in a path is 15.
• If a router receives a routing update that contains a new or
changed entry, and if increasing the metric value by 1 causes the
metric to be infinity (that is, 16), the network destination is
considered unreachable.
• The downside of this stability feature is that it limits the maximum
diameter of a RIP network to less than 16 hops.
RIP VERSION 1 & 2

• RIP version 1 is classfull (no subnet mask)


• RIP version 2 is classless

• Classfull routing protocols have three major limitations:


• Does not support discontiguous networks.
• Does not support VLSM (Variable-length Subnet Mask).
• Does not support CIDR (Classless Inter-Domain Routing).
RIP VERSION 1 & 2
RIP VERSION 1 & 2

• Discontingous Network
• Discontiguous network is a network that has two or more subnetworks
of a classful network joined together by different classful networks.
RIP VERSION 1 & 2

• VLSM
• It amounts to "subnetting subnets," which means that VLSM allows
network engineers to divide an IP address space into a hierarchy of
subnets of different sizes, making it possible to create subnets with
very different host counts without wasting large numbers of
addresses.
RIP VERSION 1 & 2
• CIDR
• CIDR (Classless Inter-Domain Routing, sometimes called supernetting) is a way to
allow more flexible allocation of Internet Protocol (IP) addresses than was possible
with the original system of IP address classes.
RIP VERSION 1 & 2
• RIP v1 can sends updates to only v1 & can receive updates from
both v1 & v2.
• RIP v2 can send & receive updates from v2.
• Updates under RIPv2 are sent as a multicast to address 224.0.0.9.
• RIPv1 sends updates as a broadcast (255.255.255.255).

• Multicasts can take up less bandwidth on the network.

You might also like