Scribd
Upload
32 views5 pages

Computer Communications ECE - 4008: Lab Task - 5

This document summarizes a student lab task on the Routing Information Protocol (RIP). RIP is a distance-vector routing protocol that uses hop count as its routing metric. It has an administrative distance of 120 and operates at the network layer. The task involves using NetSim to simulate RIP routing under different network configurations and link failures to observe how RIP dynamically determines the best path between source and destination networks. Simulation results show RIP correctly identifying the lowest hop path initially and recalculating a new path when the shortest path fails.

Uploaded by

Saumya Shankar
Copyright
© © All Rights Reserved
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
32 views5 pages

Computer Communications ECE - 4008: Lab Task - 5

This document summarizes a student lab task on the Routing Information Protocol (RIP). RIP is a distance-vector routing protocol that uses hop count as its routing metric. It has an administrative distance of 120 and operates at the network layer. The task involves using NetSim to simulate RIP routing under different network configurations and link failures to observe how RIP dynamically determines the best path between source and destination networks. Simulation results show RIP correctly identifying the lowest hop path initially and recalculating a new path when the shortest path fails.

Uploaded by

Saumya Shankar
Copyright
© © All Rights Reserved
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
You are on page 1/ 5

COMPUTER COMMUNICATIONS

ECE - 4008

LAB TASK – 5

ROUTING INFORMATION PROTOCOL(RIP)

SUBMITTED TO:
PROF. VELMURUGAN T

SUBMITTED BY:
SAUMYA SHANKAR

16BEC0045

L3+L4
TASK-5
ROUTING INFORMATION PROTOCOL (RIP)
 AIM:
To design a network to implement Spanning Tree Protocol (STP) algorithm
under various priority conditions.

 TOOLS USED:
Net Sim

 THEORY:
The Routing Information Protocol ('RIP') is one of the oldest distance-
vector routing protocols which employ the hop count as a routing metric. RIP
prevents routing loops by implementing a limit on the number of hops allowed
in a path from source to destination.

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. It is a distance vector routing protocol which has AD value
120 and works on the application layer of OSI model.

Features of RIP :

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 as Routing on rumours.
 NETWORK FORMATION:

CASE – 1 (NO LINK REMOVED)

CASE – 2 (LINK REMOVED FROM SHORTEST PATH)


 SIMULATION RESULTS:

CASE -1

CASE-2
 INFERENCE
From the above two cases we observe that, in CASE-1 , the number of hops = 3,
which corresponds to the lowest path as identified by the RIP protocol.

In case-2, when one of the links of the shortest path is removed, the RIP
protocol looks for the other shortest path and accordingly gives the number of
hops = 4.

This is verified through simulation as well.

You might also like