ISSN (Online) : 2319 – 8753

ISSN (Print) : 2347 - 6710

International Journal of Innovative Research in Science, E ngineering and Technology

An ISO 3297: 2007 Certified Organization, Volume 3, Special Issue 1, February 2014

International Conference on Engineering Technology and Science-(ICETS’14)

On 10th & 11th February Organized by

Department of CIVIL, CSE, ECE, EEE, MECHNICAL Engg. and S&H of Muthayammal College of Engineering, Rasipuram, Tamilnadu, India

Performance Analysis of Dynamic Routing

Protocols Using Packet Tracer
N.Nazumudeen1, C.Mahendran2
PG Student, Department of ECE, A.C College of Engineering and Technology, Karaikudi-630004, India 1
Assistant Professor, Department of ECE, A.C College of Engineering and Technology, Karaikudi-63000, India 2

Abstract- Performance of a network is based on The dynamic routing protocols keep the routing
routing protocols. RIPv1, RIPv2, EIGRP and OSPF tables updated. This paper specifies the Open Shortest
are the dynamic routing protocols being used in the Path First (OSPF), Enhanced Interior Gateway Routing
practical networks to propagate network topology Protocol (EIGRP) and Routing Information Protocol
information to the neighboring routers. There have (RIP) TCP/IP internet routing. The network based on
been a large number of static and dynamic routing TCP/IP protocol permits the efficient routing of data
protocols available but choice of the right protocol for packets based on their IP address. Routers are used in the
routing is dependent on many parameters critical network to control and forward data.
being network convergence time, Ethernet delay,
security and bandwidth requirement etc. In this In the packetized communication of information, the
paper, we propose the idea of routing protocols, function of routing is moving traffic across networks and
starting with an overview of the basics of Interior the routers should be aware of where they should forward
Gateway Protocols (IGP). Later, we describe the idea the traffic next in order to reach the final destination. In
of Link State Routing Protocols (LSRP) and Distance order for routers to effectively and efficiently distribute
Vector Routing Protocols (DVRP) while making a data, the choice of the routing protocol becomes very
comparison which should determine the protocol critical factor to define the success of the network over
needed for each network topology. The characteristics time. Factors that differentiate one routing protocol from
of each routing protocol will be also discussed. another include the speed that it adapts to topology
According to the designed simulation experiment changes called as convergence, the ability to choose the
scenarios compare the difference between RIPv1, best route among multiple routes and the amount of
RIPv2, OSPF and EIGRP routing protocols. network traffic that the routing protocol creates.

Keywords- Interior Gateway Protocol (IGP), II. PACKET TRACER

Border Gateway Protocol (BGP), Link State Routing Packet Tracer is a Cisco router simulator that can be
Protocols (LSRP), Distance Vector Routing Protocols utilized in training and education, but also in research for
(DVRP), Routing Information Protocol (RIP), computer network simulations. The tool is created by
Enhanced Interior Gateway Routing Protocol Cisco Systems and provided for free distribution to
(EIGRP), Open Shortest Path First (OPSF). faculty, students, and alumni who are all have participated
in the Cisco Networking Academy. Packet Tracer
I. INTRODUCTION supports users for creation of simulations, visualizations,
A routing protocol works based on an algorithm. and animations of networking phenomena. Like any
Routing algorithm also based on metrics to find the path simulation, Packet Tracer relies on a simplified model of
to transmit data across two networks. Metrics also include networking devices and protocols. It provides a simulated
cost, bandwidth, Maximum Transmit Unit, delay, number environment where processes between various
of hop count these metrics also save or store in routing networking devices, such as routers, switches, wireless
table. Routing protocol has two types. First one is an access points, computers, links and applications are
interior gate way protocol and other one is an exterior visible with animations and easy explanatory descriptions.
gateway protocol. OSPF is also interior gate way The purpose of Packet Tracer is to offer students and
protocol, other interior gate way Protocol are RIP, teachers a tool to learn the principles of networking as
EIGRP, IGRP. BGP and BGP4 is Exterior gate way well as develop Cisco technology specific skills.
protocol.
Copyright to IJIRSET www.ijirset.com 570
 ISSN (Online) : 2319 – 8753
ISSN (Print) : 2347 - 6710

International Journal of Innovative Research in Science, E ngineering and Technology

An ISO 3297: 2007 Certified Organization, Volume 3, Special Issue 1, February 2014

International Conference on Engineering Technology and Science-(ICETS’14)

On 10th & 11th February Organized by

Department of CIVIL, CSE, ECE, EEE, MECHNICAL Engg. and S&H of Muthayammal College of Engineering, Rasipuram, Tamilnadu, India

of convergence with any change of topology of the

internetwork.

OSPF is an example of link state routing protocol.

TABLE I
DIFFERENCE BETWEEN DVRP AND LSRP

Algorithms DVRP LSRP

Ease of
Yes No
configuration

Complexity No Yes
Fig.1 Packet Tracer Simulation Environment
Bandwidth
High Low
Consumption
III. ROUTING PROTOCOLS
Most of the routing algorithms are possible to be
classified like one of two basic algorithms: IV. ROUTING INFORMATION PROTOCOL (RIP)
The RIP allows that routers update their routing
A. Distance Vector characteristics: tables at programmable intervals, generally every 30
1. The routing by distance vector collects data of the seconds. One of the disadvantages of routers that use RIP
information of the routing table of its neighbors. is that constantly they are connected with routers
2. The routing by distance vector determines the best neighboring to update his tables of routing, generating
route adding the metric value that receives as the therefore a great amount of network traffic. This makes
routing information happens from router to another by means of a denominated concept vector-distance. A
one. jump is entered whenever the data cross to router that is to
3. With most of the protocols of routing by distance say, happen through a new number of network, this is
vector, the updates for the change of topology considered equivalent to a jump. A route that has an equal
consist of periodic updates of the tables. The number of jumps to 4 indicates that the data which they
information happens from router to another one, are transported must cross 4 routers before arriving at
giving generally like result one more a slower their final destiny in the network. If there are multiple
convergence. routes towards a destiny, the route with the smaller
number of jumps is the route selected by router.
RIP and EIGRP are examples of distance vector routing
protocols. As the number of jumps is only metric of routing
used by the RIP, not necessarily it selects the fastest route
B. Link state characteristics: towards its destiny. A metric one is a measurement unit
The link state routing obtains a great vision of the that allows making decisions and next will learn that other
topology of complete internetwork accumulating all the protocols of routing use other metric ones in addition to
necessary LSA. the number of jumps to find the best route of data transfer.
Nevertheless, the RIP continues being very popular and it
1. In the link state routing, each router works is continued implementing widely. The main reason of
independently to calculate its own shorter route this is that it was one of the first protocols of routing that
towards the networks destiny. were developed.
2. With the protocols of routing of connection state,
the updates are caused generally by changes in the A. RIP characteristics:
topology. 1. Distance vector routing protocol.
3. The relatively small LSA that have gone to all the 2. It metric is the number of jumps.
others routers generally give like result faster times 3. The maximum number of jumps is 15.
4. One updates every 30 seconds.

Copyright to IJIRSET www.ijirset.com 571

 ISSN (Online) : 2319 – 8753
ISSN (Print) : 2347 - 6710

International Journal of Innovative Research in Science, E ngineering and Technology

An ISO 3297: 2007 Certified Organization, Volume 3, Special Issue 1, February 2014

International Conference on Engineering Technology and Science-(ICETS’14)

On 10th & 11th February Organized by

Department of CIVIL, CSE, ECE, EEE, MECHNICAL Engg. and S&H of Muthayammal College of Engineering, Rasipuram, Tamilnadu, India

5. Not always it selects the fastest route for the An EIGRP router also has a more complete view of
packages. the network than a typical distance vector protocol as it
6. It generates great amount of traffic of network with not only maintains its own routing table, but also keeps a
updates. copy of the routing tables of neighboring routers. When
an EIGRP router cannot find a route to a network based
There are two versions of RIP, namely RIPv1 and RIPv2. on all the information it currently has and it sends out a
The table below summarizes the differences between query to other routers, which is propagated until a route is
these versions. found.
TABLE II
DIFFERENCE BETWEEN RIP TYPES VI. OPEN SHORTEST PATH FIRST(OSPF)
Protocol OSPF proposes the use of shorter and
RIP Versions RIPv1 RIPv2 accessible routes by the construction of a map of the
network and data base maintenance with information on
Best for Small network Small network local and neighboring systems, this way it is able to
Supports calculate the metric for each route, and then the shorter
No Yes routing routes are chosen. In this process the metric of
VLSM
state of the connection and distance are calculate in the
Classes Full Classless
case of RIP calculates only the distance and not the link
traffic, by this cause OSPF is a routing protocol designed
V. ENHANCED INTERIOR GATEWAY ROUTING for networks with growth constant and able to handle a
PROTOCOL(EIGRP) distributed routing table and fast propagation, between
EIGRP is an enhanced version of IGRP (Interior routers. The Link State Database (LSDB) contains the
Gateway Routing Protocol), an obsolete routing protocol link state advertisements sent around the 'Area' and each
that was developed by Cisco. It is an advanced distance- router holds an identical copy of this LSDB. The router
vector protocol that implements some characteristics then creates a Shortest Path First (SPF) tree using
similar to those of link-state protocols. Some Cisco Dijkstra's algorithm on the LSDB and a routing table can
documentation refers to EIGRP as a hybrid protocol. be derived from the SPF tree which now contains the best
EIGRP advertises its routing table to its neighbors as route to each router
distance-vector protocols do, however it uses the hello
A. OSPF characteristics:
protocol and forms neighbor relationships similar to link-
state protocols.
1. Fast detection of changes in the topology and very
EIGRP sends partial updates when a metric or the fast re-establishment of routes without loops.
topology on the network changes. It does not send full 2. Low overload, use updates that inform about
routing-table updates in periodic fashion as distance- changes on routes.
vector protocols do. EIGRP is a classless protocol that 3. Division of traffic by several equivalent routes.
permits the use of VLSMs (Variable Length Subnet 4. Routing according to type of service.
Masks) and supports CIDR (Classless Inter-Domain 5. Authentication.
Routing) for a scalable allocation of IP addresses.
TABLE III
EIGRP uses the metrics like bandwidth, delay, DIFFERENCE BETWEEN RIP, EIGRP AND OSPF ROUTING
reliability, load, and MTU in making its routing decisions. PROTOCOLS
The default metrics used are bandwidth and delay. For a
more granular level of control, EIGRP multiplies each of Protocol RIP EIGRP OSPF
the metrics by 256 before performing the calculation of
Small Large Large
the composite metric. EIGRP has been designed to make suits
network network network
much better use of bandwidth, and to allow routers to
have a much better awareness of neighboring routers. Convergence
slow fast Fast
Instead of sending its entire routing table out at regular time
intervals, an EIGRP router sends out only partial updates,
and even then, only when a route changes. This makes a
better use of the available network bandwidth.

Copyright to IJIRSET www.ijirset.com 572

 ISSN (Online) : 2319 – 8753
ISSN (Print) : 2347 - 6710

International Journal of Innovative Research in Science, E ngineering and Technology

An ISO 3297: 2007 Certified Organization, Volume 3, Special Issue 1, February 2014

International Conference on Engineering Technology and Science-(ICETS’14)

On 10th & 11th February Organized by

Department of CIVIL, CSE, ECE, EEE, MECHNICAL Engg. and S&H of Muthayammal College of Engineering, Rasipuram, Tamilnadu, India

Ease of
Easy easiest Complex
configuration

100% loop free No yes Yes

Only in
VLSM yes Yes
RIPv2

Bandwidth
High low Moderate
consumption

VII. NETWORK ANALYSIS

In order to analyse the network in terms of network
convergence activity, Ethernet delay and protocol traffic Fig. 2 Performance based on Network convergence
sent are chosen.
B. Routing Traffic: Network traffic or data traffic is data
A. Network Convergence: Convergence is the process of in a network. In computer networks, the data is
routers agreeing on optimal routes for forwarding packets encapsulated in network packets. Data transmitted over a
and thereby completing the updating of their routing network. Traffic is a very general term and typically
tables. Convergence occurs as a result of a change in refers to overall network usage at a given moment.
network topology, i.e., a link becoming available or However, it can refer to specific transactions, messages,
unavailable. When this occurs, each router independently records or users in any kind of data or telephone network.
runs a routing algorithm to recalculate metrics and build a OSPF protocol provides higher traffic compared to
new routing table based on this information. Once all the EIGRP and RIP. After failure/recovery happened, OSPF
routing tables have been updated, convergence is protocol provides lower traffic than EIGRP.
complete.
The time required before all of the routers can reach
a consensus regarding the new topology, called
convergence time, depends on the number of routers in
the network that use dynamic routing protocols, the
distance of routers (measured in hops) from the point of
change, the bandwidth and traffic load on
communications links and the load on the routers. Among
the ways in which convergence time can be minimized
are using improved convergence algorithms and designing
the network so that fewer routers need to converge and so
that the load on any given router or communications link
is minimized.
Convergence is necessary because routers are
intelligent devices that are capable of making their own
routing decisions. This distributed intelligence is usually a
huge advantage, because it allows large networks to be
vastly faster, more robust and more efficient than would
be possible with direct human intervention. For EIGRP
protocol, the network convergence time is the shortest but
the OSPF network takes more time than the EIGRP
Network. Fig. 3 Performance based on Routing Traffic

Copyright to IJIRSET www.ijirset.com 573

 ISSN (Online) : 2319 – 8753
ISSN (Print) : 2347 - 6710

International Journal of Innovative Research in Science, E ngineering and Technology

An ISO 3297: 2007 Certified Organization, Volume 3, Special Issue 1, February 2014

International Conference on Engineering Technology and Science-(ICETS’14)

On 10th & 11th February Organized by

Department of CIVIL, CSE, ECE, EEE, MECHNICAL Engg. and S&H of Muthayammal College of Engineering, Rasipuram, Tamilnadu, India

C. Ethernet Delay: Network delay is an important design improved scalability and for sure the great handling of
and performance characteristic of a computer network or routing loops and also EIGRP has a great impact in HTTP
telecommunications network. The delay of a network application which gives it the power to be in the lead of
specifies how long it takes for a bit of data to travel across routing protocols.
the network from one node or endpoint to another. It is
typically measured in multiples or fractions of seconds. REFERENCES
Delay may differ slightly, depending on the location of [1] MaryAnne B. Taquiqui (2013) “Protocol Data Unit (PDU): A
the specific pair of communicating nodes. Thus, engineers Simulation”, Network and Complex Systems, Bahrain.
[2] Abdulrahman Alkandari (2012) “An Anatomy of IGP and
usually report both the maximum and average delay, and BGP Routing Protocols”, International Islamic University,
they divide the delay into several parts: Processing delay, Malaysia.
Queuing delay, Transmission delay and Propagation [3] Don Xu and Ljiljana Trajkovic (2011) “Performance Analysis
delay. of RIP, EIGRP and OSPF based on OPNET”, OPNETWORK
2011, Washington DC.
Processing Delay- time routers take to process the packet [4] Shravan K. Naivety and Santosh K. Balsu (2011) “Performance
header Comparison of EIGRP and ISIS/RIP Protocols”, School of
Queuing Delay- time the packet sends in routing queues Computing/Telecom, Karlskron, Sweden.
Transmission Delay- time it takes to push the packet’s [5] Khalid Abu Al-Saud, Mohammed Saleh (2008) “Impact of
MD5 Authentication on Routing Traffic for the Case of EIGRP,
bits on the link RIPv2 and OSPF”, University Utara Malaysia
Propagation Delay- time for a signal to reach its [6] Lemma.E, Hussain .S, Anjelo .W (2010) “Performance
destination Comparison of EIGRP/IS-IS and OSPF/IS-IS”, Blenkinge
There is a certain minimum level of delay that will be Tekniska Hogskolan, Sweden.
[7] Ayub,N., et al. (2011). Performance Analysis of OSPF and
experienced due to the time it takes to transmit a packet EIGRP Routing Protocols with Respect to theConvergence,
serially through a link. European Journal of Scientific Research, ISSN 1450-216X Vol.
Onto this is added a more variable level of delay due 61 No. 3, pp434-447.
to network congestion. IP network delays can range from [8] Farhangi, S. et al. (2012). Performance Comparison of Mixed
Protocols Based on EIGRP, IS-IS and OSPF for Real Time
just a few milliseconds to several hundred milliseconds. Applications, Middle-East Journal of Scientific Research 12
EIGRP provides lowest delay and RIP provides highest (11): 1502-1508, 2012 ISSN 1990-9233.
delay. [9] Lammle, Todd. (2011). Cisco Certified Network Associate
Study Guide, Wiley Publishing, Inc., Seventh Edition.
[10] http://cisco.netacad.net.

Fig. 4 Performance based on Ethernet delay

VIII. CONCLUSION
This paper demonstrated that CISCO Packet Tracer
can be employed by network planners to select the most
suitable routing protocol for various networks and to
design an optimal routing topology. Among the IGP types
the best protocol is EIGRP because it provides a better
performance than RIP and OSPF, it has a good impact in
the world of networking due to its fast convergence time,
Copyright to IJIRSET www.ijirset.com 574