223a1131 Umair Momin Exp7

EXPERIMENT NO.
Dynamic Routing
Aim: i. Build a simple network using routers, switches and end users.
ii. Configure it for dynamic routing RIP protocol using packet tracer.
iii. Inspect the packet routes and routing table.
System Software Requirements: Cisco Packet Tracer, Windows-10 / Ubuntu.
Theory:
Routing is a procedure of making decisions in which the router (which is a hardware device used
in networking to receive and send data in the form of packets on a network) selects the best path
to make data transfer from source to destination. A router exists in the network layer in the OSI
as well as TCP/IP model. Some functions of a router are:
 Building an optimal path on a network to reach its destination (in which static and
dynamic routing take place).
 Taking routing decisions.
 Balancing load.
Dynamic routing, also called adaptive routing, is a process where a router can forward data via
a different route for a given destination based on the current conditions of the communication
circuits within a system. The term is most commonly associated with data networking to describe
the capability of a network to 'route around' damage, such as loss of a node or a connection
between nodes, as long as other path choices are available. Dynamic routing allows as many
routes as possible to remain valid in response to the change. Dynamic routing is a technique of
finding the best path for the data to travel over a network in this process a router can transmit
data through various different routes and reach its destination on the basis of conditions at that
time of communication circuits.
There are several protocols that can be used for dynamic routing. Routing Information Protocol
(RIP) is a distance-vector routing protocol that prevents routing loops by implementing a limit
on the number of hops allowed in a path from source to destination. Open Shortest Path First
(OSPF) uses a link state routing (LSR) algorithm and falls into the group of interior gateway
protocols (IGPs). Intermediate System to Intermediate System (IS-IS) determines the best route
for data through a packet-switched network.
The Routing Information Protocol (RIP) is one of the oldest distance-vector routing protocols
which employs 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. The largest number of
hops allowed for RIP is 15, which limits the size of networks that RIP can support. RIP
implements the split horizon, route poisoning, and hold down mechanisms to prevent incorrect
routing information from being propagated.
Department of Computer Engineering CSL502: Computer Network Lab

RIP version 1:
When starting up, and every 30 seconds thereafter, a router with RIPv1 implementation
broadcasts to 255.255.255.255 a request message through every RIPv1 enabled interface.
Neighbouring routers receiving the request message respond with a RIPv1 segment, containing
their routing table. The requesting router updates its own routing table, with the reachable IP
network address, hop count and next hop, that is the router interface IP address from which the
RIPv1 response was sent. As the requesting router receives updates from different neighbouring
routers it will only update the reachable networks in its routing table, if it receives information
about a reachable network it has not yet in its routing table or information that a network it has
in its routing table is reachable with a lower hop count. Therefore, a RIPv1 router will in most
cases only have one entry for a reachable network, the one with the lowest hop count. If a router
receives information from two different neighbouring router that the same network is reachable
with the same hop count but via two different routes, the network will be entered into the routing
table two times with different next hop routers. RIPv1 enabled routers not only request the
routing tables of other routers every 30 seconds, they also listen to incoming requests from
neighbouring routers and send their own routing table in turn. RIPv1 routing tables are therefore
updated every 25 to 35 seconds. The RIPv1 protocol adds a small random time variable to the
update time, to avoid routing tables synchronizing across a LAN. RIPv1 can be configured into
silent mode, so that a router requests and processes neighbouring routing tables, and keeps its
routing table and hop count for reachable networks up to date, but does not needlessly send its
own routing table into the network. Silent mode is commonly implemented to hosts. RIPv1 uses
classful routing. The periodic routing updates do not carry subnet information, lacking support
for variable length subnet masks (VLSM). This limitation makes it impossible to have different-
sized subnets inside of the same network class. In other words, all subnets in a network class
must have the same size. There is also no support for router authentication, making RIP
vulnerable to various attacks.
RIP version 2:
RIP version 2 (RIPv2) includes the ability to carry subnet information, thus supporting Classless
Inter-Domain Routing (CIDR). To maintain backward compatibility, the hop count limit of 15
remained. RIPv2 has facilities to fully interoperate with the earlier specification if all Must Be
Zero protocol fields in the RIPv1 messages are properly specified. In addition, a compatibility
switch feature allows fine-grained interoperability adjustments. In an effort to avoid unnecessary
load on hosts that do not participate in routing, RIPv2 multicasts the entire routing table to all
adjacent routers at the address 224.0.0.9, as opposed to RIPv1 which uses broadcast. Unicast
addressing is still allowed for special applications. Route tags were also added in RIP version 2.
This functionality allows a distinction between routes learned from the RIP protocol and routes
learned from other protocols. It supports authentication and does subnetting and multicasting.
Auto summary can be done on every router. In RIPv2 Subnet masks are included in the routing
update. RIPv2 multicasts the entire routing table to all adjacent routers at the address 224.0.0.9,
as opposed to RIPv1 which uses broadcast (255.255.255.255).

Name of the Student: Umair Momin
Roll No.: 223A1131
Class: TE- CE
Batch: D3
EXPERIMENT NO. 7
Dynamic Routing
Aim: i. Build a simple network using routers, switches and end users.
ii. Configure it for dynamic routing RIP protocol using packet tracer.
iii. Inspect the packet routes and routing table.
System Software Requirements: Cisco Packet Tracer, Windows-10 / Ubuntu
Output:

Router 2

Router 3

PC0

PC1

PC2

PC3

Conclusion: In this experiment, we successfully configured a simple network using routers,
switches, and end users, and implemented dynamic routing using RIP protocol in Cisco Packet
Tracer, demonstrating the principles of dynamic routing and its advantages in adapting to
network changes.

223a1131 Umair Momin Exp7

Uploaded by

Copyright:

Available Formats

223a1131 Umair Momin Exp7

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

223a1131 Umair Momin Exp7

Uploaded by

Copyright:

Available Formats

EXPERIMENT NO.

System Software Requirements: Cisco Packet Tracer, Windows-10 / Ubuntu.

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

System Software Requirements: Cisco Packet Tracer, Windows-10 / Ubuntu

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

Department of Computer Engineering CSL502: Computer Network Lab

You might also like