T.Y.B.

Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

Name: Charul Wankhede

CNum: UEC2021166
Experiments no: 4

Aim:- Study of Network simulation tools to configure and see behavior of IP routing protocols
like RIP, BGP etc.)
Objectives:Configure routers using basic interface configuration commands, Enable RIP, Verify
the RIP configuration using Network simulation tool Cisco Packet Tracer
Theory:
Cisco Packet Tracer:
Packet Tracer is a network simulation tool that allows us to create network topologies by
building virtual networking devices. Packet Tracer is highly encouraged for network enthusiasts
as it allows them to have keen in-depth knowledge of networking.

Classification of Routing Protocols

Routing Information Protocol (RIP) is a dynamic routing protocol that uses hop count as a
routing metric to find the best path between the source and the destination network. RIP uses
port number 520.

How Routing Information Protocol works

RIP uses a distance vector algorithm to decide which path to put a packet on to get to its
destination. Each RIP router maintains a routing table, which is a list of all the destinations the
router knows how to reach. Each router broadcasts its entire routing table to its closest neighbors

1 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

every 30 seconds. In this context, neighbors are the other routers to which a router is connected
directly -- that is, the other routers on the same network segments as the selected router. The
neighbors, in turn, pass the information on to their nearest neighbors, and so on, until all RIP
hosts within the network have the same knowledge of routing paths. This shared knowledge is
known as convergence.

RIP operates on the application layer of the OSI model. The configuration process for the
Routing Information Protocol is fairly simple. Once IP addresses have been assigned to the
involved computers and interfaces of routers, then developers can issue the router RIP command
-- which tells the router to enable RIP. Then, developers can use the network command, which
enables users to identify the networks with which they want to work. Only the networks directly
associated with the router need to be specified.

Router in this protocol basically implements the distance-vector routing algorithm However, the
algorithm has been modified as described below.
First, since a router in an AS (Autonomous System) needs to know how to forward a packet to
different networks (subnets) in an AS, RIP routers advertise the cost of reaching different
networks instead of reaching other nodes in a theoretical graph. In other words, the cost is
defined between a router and the network in which the destination host is located.
Second, to make the implementation of the cost simpler (independent from performance factors
of the routers and links, such as delay, bandwidth, and so on), the cost is defined as the number
of hops, which means the number of networks (subnets) a packet needs to travel through from
the source router to the final destination host. Note that the network in which the source host is
connected is not counted in this calculation because the source host does not use a forwarding
table; the packet is delivered to the default router. Figure shows the concept of hop count
advertised by three routers from a source host to a destination host. In RIP, the maximum cost
of a path can be 15, which means 16 is considered as infinity (no connection). For this reason,
RIP can be used only in autonomous systems in which the diameter of the AS is not more than
15 hops.

Fig. Hop counts in RIP

RIP processes, a client and a server, like any other processes, need to exchange Messages RIP
has two types of messages: request and response. A request message is sent by a router that has
just come up or by a router that has some time-out entries. A request message can ask about

2 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

specific entries or all entries. A response (or update) message can be either solicited or
unsolicited. A solicited response message is sent only in answer to a request message. It contains
information about the destination specified in the corresponding request message. An unsolicited
response message, on the other hand, is sent periodically, every 30 seconds or when there is a
change in the forwarding table.

Steps to Configure and Verify Three Router Connections in Cisco Packet Tracer using RIP
Routing:
Step 1: First, open the Cisco packet tracer desktop and select the devices PC,Switches & routers

● Then, create a network topology as shown below the image.

● Use an Automatic connecting cable to connect the devices with others.

Step 2: Configure the PCs (hosts) with IPv4 address and Subnet Mask according to the IP
addressing table
Step 3: Configure router with IP address and Subnet mask.

● To assign an IP address in router0, click on router0.

● Then, go to config and then Interfaces.
● Make sure to turn on the ports.
● Then, configure the IP address in FastEthernet and serial ports according to IP addressing
Table.
● Fill IPv4 address and subnet mask.
● Repeat this for every router in network

Step 4: Verifying the network by pinging the IP address of any PC.

● We will use the ping command to do so.

● First, click on PC0 then Go to the command prompt.
● Then type ping <IP address of targeted node>.

Result:

a)Diagram of network with PC & Router configuration’

3 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

4 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

5 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

6 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

7 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

8 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

9 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

b) Result of ping command between any two PCs in network

Conclusion:

Short Questions

1. Explain Bellman-Ford equation

Bellman-Ford is a single source shortest path algorithm that determines the

shortest path between a given source vertex and every other vertex in a
graph. This algorithm can be used on both weighted and unweighted graphs.

Working

Now, let’s know the working of the bellman ford algorithm, and how exactly the
algorithm deals with negative edges using dynamic programming approaches. the
step-by-step working of the algorithm is as follows:

10 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

Step-1: Initialize the distance value Infinite to every other vertex and set distance value 0 to the
source node itself.

Step-2: Visit each edge and relax the path if the previous path was not accurate. To relax the path
for vertices and for edge u-v:

If, (d(u) + c(u , v) < d(v))

d(v) = d(u) + c(u , v)

the above equation means if the sum of distance value of source node and cost of moving from
source to destination is less than distance of source vertex. Then, the distance value of
destination vertex from the source vertex will be equals to distance value of the source and cost
of reaching the destination from source.

Step-3: If the new distance value is less than the previous one, then update the distance value in
each iteration for the edges. The distance value to every node is the total distance from the
starting vertex to that particular vertex.

Step-4: Repeat the above steps multiple iterations, to ensure the obtained result is optimized.

2. Explain the concept of hop count in RIP.

In the context of the Routing Information Protocol (RIP), hop count refers to the metric
used to determine the distance between routers in a network. RIP is a distance-vector
routing protocol used to exchange routing information within a small to medium-sized
network.

Here's how hop count works in RIP:

1. Definition: A hop refers to each router or network device that data packets must pass
through between the source and destination. The hop count is simply the number of
routers a packet must traverse to reach its destination.

2. Metric: In RIP, each hop along the path between the source and destination is counted
as a metric. By default, RIP considers the number of hops as the metric for determining
the best route to a destination network.

3. Routing Table Entry: RIP routers maintain a routing table where they store information
about reachable networks along with the corresponding hop count. When a router learns

11 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

about a network from its neighbors, it updates its routing table with the network's
address and the number of hops required to reach that network.

4. Path Selection: RIP routers use the hop count as the primary criterion for selecting the
best path to a destination network. A route with the fewest hops is considered the best
route. However, RIP has a maximum hop count limit of 15. If a route exceeds this limit,
it's considered unreachable.

5. Convergence: RIP routers periodically exchange routing information with their

neighboring routers, updating each other about network changes. When a network
topology change occurs, such as a link failure or network outage, routers recalculate
their routing tables based on the updated information received from neighboring routers.
This process continues until all routers in the network converge on the new routing
information.

Overall, hop count in RIP serves as a simple metric for determining the best routes
within a network. However, RIP's reliance solely on hop count makes it less suitable for
large, complex networks where other factors like network bandwidth, latency, or reliability
may be more important considerations for routing decisions.
3. Compare RIP and OSPF protocols

RIP OSPF

RIP Stands for Routing OSPF stands for Open Shortest

Information Protocol. Path First.

RIP works on the OSPF works on Dijkstra

Bellman-Ford algorithm. algorithm.

12 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

It is a Distance Vector It is a link-state protocol and it

protocol and it uses the analyzes different sources like
distance or hops count to the speed, cost and path
determine the transmission congestion while identifying the
path. shortest path.

It is used for smaller size It is used for larger size

organizations. organizations in the network.

It allows a maximum of 15 There is no such restriction on

hops. the hop count.

It is not a more intelligent It is a more intelligent routing

dynamic routing protocol. protocol than RIP.

The networks are classified as

The networks are classified areas, sub-areas, autonomous
as areas and tables here. systems, and backbone areas
here.

13 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

Its administrative distance is Its administrative distance is

120. 110.

RIP uses UDP(User

OSPF works for IP(Internet
Datagram Protocol)
Protocol) Protocol.
Protocol.

It calculates the metric in It calculates the metric in terms

terms of Hop Count. of bandwidth.

In RIP, the whole routing

In OSPF, parts of the routing
table is to be broadcasted to
table are only sent when a
the neighbors every 30
change has been made to it.
seconds by the routers.

RIP utilizes less memory OSPF device resource

compared to OSPF but is requirements are CPU intensive
CPU intensive like OSPF. and memory.

14 | Page
T.Y.B.Tech(E&TC) ,CCEW Computer Network & Security Lab (2022-23) Sem 2

It consumes more
bandwidth because of It consumes less bandwidth as
greater network resource only part of the routing table is
requirements in sending the to send.
whole routing table.

Its multicast address is OSPF’s multicast addresses are

224.0.0.9. 224.0.0.5 and 224.0.0.6.

15 | Page