0% found this document useful (0 votes)
6 views2 pages

CN 7

The document outlines the Routing Information Protocol (RIP), which determines the best path for data across a network by sharing routing information between routers. Key features include hop count as the metric, a maximum hop count of 15, and periodic updates every 30 seconds. While RIP is simple and suitable for smaller networks, it has limitations such as slower convergence compared to more advanced protocols.

Uploaded by

rashijain481
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views2 pages

CN 7

The document outlines the Routing Information Protocol (RIP), which determines the best path for data across a network by sharing routing information between routers. Key features include hop count as the metric, a maximum hop count of 15, and periodic updates every 30 seconds. While RIP is simple and suitable for smaller networks, it has limitations such as slower convergence compared to more advanced protocols.

Uploaded by

rashijain481
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

LAB 7

Aim:- To understand the concept and operation of Routing Information Protocol


(RIP)

Objective:

The objective of the Routing Information Protocol (RIP) is to determine the best path for
data to travel across a network by sharing routing information between routers. It helps
routers update their routing tables and maintain the most efficient routes to each
network destination.

Theory:

RIP is a distance-vector routing protocol that uses hop count as its metric to determine the
best path. The protocol enables routers to communicate with one another to share information
about network topology. RIP operates by sending periodic updates of the entire routing table to
directly connected routers every 30 seconds.

Key features of RIP:

●​ Metric: RIP uses hop count as its metric, where each hop between routers counts as
one.​

●​ Maximum hop count: The maximum number of hops allowed in RIP is 15, which
means any destination more than 15 hops away is considered unreachable.​

●​ Routing updates: RIP routers send updates every 30 seconds to their neighbors,
allowing for the exchange of information about reachable destinations and their hop
counts.​

●​ Convergence: RIP can take longer to converge, meaning it may take more time to
adapt to changes in the network like failed links.​

RIP has two main versions:

1.​ RIP v1: A classful routing protocol that doesn’t support Variable Length Subnet Masks
(VLSM) or Classless Inter-Domain Routing (CIDR).​
2.​ RIP v2: A classless version that supports VLSM and CIDR, allowing for more flexibility in
IP address allocation.​

Observation :-

Conclusion:

RIP is a simple, easy-to-implement routing protocol primarily used in smaller networks due to its
limitations, such as the 15-hop count and slower convergence times. While it's less efficient
compared to more advanced protocols like OSPF or EIGRP, RIP is still useful in environments
where simplicity is more important than performance.

You might also like