See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/318128965

Performance Evaluation of Real Time and Non-Real Time Applications

Working Paper · July 2017

DOI: 10.13140/RG.2.2.23500.51848

CITATIONS READS
0 75

2 authors, including:

Wagdy Anis Aziz

Ain Shams University
19 PUBLICATIONS   14 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

VoIP Quality Of Service Optimization In Telecom Networks View project

All content following this page was uploaded by Wagdy Anis Aziz on 04 July 2017.

The user has requested enhancement of the downloaded file.

 Performance Evaluation of Real Time and Non-
Real Time Applications
Wagdy Anis Abd El-Rahman Emad El-Nabwy
Orange Orange
Cairo, Egypt Cairo, Egypt
wagdy.anis@Orange.com Abdelrhman.nabwy@orange.com

Abstract— there has been rapid growth in Real time At start up:
and Non-Real Time application, and that growth
basically depends on the growth of the routing protocols 1- Each router collects its directly
in the area of communications. To deliver data from connected networks.
source to destination we have to choose the best path 2- Each router will add these networks to
that guarantee the best performance for different
its routing table.
applications and it is the responsibility of routing
protocols. Also the source and destination to be 3- Each router will send its full routing
reachable they should have a unique address and that is table out of all its active interfaces on
the role of routed protocol whether IPv4 or IPv6. broadcast address 255.255.255.255
every certain period (30 sec for RIP,
This is paper is a study based on simulation 90 sec for IGRP)
comparative performance evaluation between Real time
4- Routers receiving updates will use
and Non-Real time applications with different routing
protocols depends on different routed protocols. Bellman Ford Algorithm to calculate
table updates
I. INTRODUCTION
After convergence: - Only periodic updates are sent every
A routing protocol is the language a router speaks with
period to indicate any changes.
other routers in order to share information about the
reachability and status of network.(1) It includes a At change: - Triggered update with full routing table is
procedure to select the best path based on the reachability sent.
information it has and for recording this information in a
route table. Regarding to select the best path, a routing Advantages:
metric will be applied and it is computed by a routing
algorithm. Protocols can fall into two groups: static routing 1- Simple Implementation and configuration
and dynamic routing. Static routing is simply the process of 2- Need low memory (only routing table)
manually entering routes into a device’s routing table via a 3- Need low CPU (use Bellman Ford
configuration file that is loaded when the routing device algorithm)
starts up. In static routing, all the changes in the logical
network layout need to be manually done by the system Disadvantages:
administrator. However, dynamic routing allows routers to
select the best path when there is a real time logical 1- Slow convergence
network layout change. 2- Classful
3- High BW utilization during convergence
Dynamic routing protocols used if multiple paths exist to period
the network and an automatic way for detecting best path or 4- Susceptible to routing loops
transitioning to another path in case of primary fail, Part of
the bandwidth is used for sending routing updates that will Solutions for routing loops:
help for the discovery of best routes, It has no
1- Triggered poisoned route with poison
administrative overhead, and it is divided into 3 basic
reverse (solve slow convergence problem
categories
also)
 Distance Vector 2- Split horizon (route learned from interface
Ex: RIP and IGRP can never be advertised back on the same
interface)
 3- Hold down timer (do not learn about a failed
network until: - It returned back - It is
learned with a better metric - Hold down
time expires (180 sec for RIP, 280 for IGRP
 Link State:
Ex: OSPF & IS-IS
At start up:
- EIGRP is considered Hybrid or advanced D.V.,
while RIPv2 is not considered hybrid, but it is
advanced D.V.
- It groups some advantages from Distance Vector
and others from Link State
- Each router will send its full routing table to its
neighbors at start up.
- At change send partial triggered update.
- Updates are sent on multicast / unicast addresses

1- Each router will try to discover its neighbors. Regarding to routed protocols, here we will use two
(using Hello protocol) different routed protocols IPv4 and IPv6. Internet
2- Each router will collect information about its Protocol version 4 (IPv4) was developed in 1981; it
interfaces and send it to its neighbors in a packet provides a 32bit addressing space containing
called LSA. 4.3billion unique Internet Protocol (IP) addresses.
3- Each router that receives the LSA will take a IPv6 satisfies the increasingly complex requirements
copy and send it as it is to its other neighbors. of hierarchical addressing that IP version 4 (IPv4)
4- Each router will form LSDB from all LSAs. does not provide. One key benefit is that IPv6 can
5- Each router will draw a LSDB tree. recreate end-to-end communications without the need
6- Each router will apply the SPF algorithm for Network Address Translation (NAT)—a
(Dijkstra algorithm) on the LSDB tree to form requirement for a new generation of shared-experience
SPF tree (RTG table). and real-time applications.
After convergence: - Periodic updates after long period.
II. CLASSIFICATION OF APPLICATIONS
(LSA refreshment)
Different applications have two categories, Real time and
At change: Non-Real time applications. Real time applications had
allergic reaction to time whether delay, variation but it has
1- The router that feels the change will send partial immunity to packet lose or it can ignore packet loses during
triggered update. sending data from source to destination, and can overcome
2- Each router will take a copy of the update then that issue using codecs, error detection and correction in
send it to its neighbors then each router rebuilds Video conference and Voice over IP. Unlike Non-Real time
the tree again. applications, they couldn’t be affected by delay or any
change in time but all sent data should be delivered as it
Advantages: sent and with the original sequence that had been sent with
it and below you can check the different applications we
1- Fast convergence assessed in that study.
2- Classless
3- Low BW utilization during convergence period
(no periodic updates)
4- No routing loops
5- Reliable protocol

Disadvantages:

1- Complex Implementation and configuration

2- Need high memory (routing table, neighbor table Figure.1: Classifications of Application
& topology database)
3- Need high CPU (use Dijkstra ‖SPF‖ algorithm) III. SIMULATION NETWORK TOPOLOGY
In this study, we used OPNET 14.5 Simulator. OPNET is
a high level simulation tool that has been used in many
high level researches. It enables simulation of heterogonous
 Hybrid /Advanced D.V
Ex: RIPv2, EIGRP networks by employing a various protocols. In real, we
cannot create such a network; it is possible only simulation
because simulation provides us mathematical and graphical
form of result and we can easily understand these results.
We build three topologies Mesh, Partial Mesh and Tree. In
these topologies we have 13 routers that are Cisco 7200
Series in the Mesh topology, 28 routers for Partial Mesh
one and 71 router for Tree topology all these routers
connected together with point to point (PPP) using Digital
Signal 3 (DS3), also we have used 8 workstations and 8
Ethernet LANs that is CISCO SW_CS_3900 series and
four Servers. Each workstation is connected to router by
1000 Base X links model. We have six profiles that are
HTTP, FTP, Mail, Database query, Voice and video Figure 2: Basic Structure of Small Mesh Topology
conferencing. All the profiles are configured with operation
mode set to simultaneous and number of repetitions is
constant (0). We are used to application definition to define
parameters for HTTP such as Page Inter-arrival time
=exponential (60) in seconds. In page properties, we have
two rows -object size first is constant (1000) and second is
medium image and number of objects (objects per page) is
constant (1) and constant (5). And in server selection,
initial repeat probability is search and page per server is
exponential (10). For database query, Transaction Inter-
arrival time (seconds) =exponential (12), Transaction Size
(bytes) =constant (32768) and Type of Service= best effort
(0). For FTP such as Inter-Request Time (seconds) = Figure 3: Basic Structure of Large Mesh Topology
exponential (360), File Size = Constant (50000) and Type
of Service = Best Effort (0). For Mail such as Send Inter-
arrival time (Seconds)= exponential (360), Send group
size= constant(3), Receive inter-arrival time (seconds) =
exponential (360), Receive group size= constant (3), E-mail
size ( bytes)= constant(2000), Symbolic server name=
Email Server and Type of Service= Best Effort(0).For
video conferencing application such as Frame Inter-arrival
time =15 frames/sec, Frame Size Information (bytes)
=128*240 pixel, Type of Services=best effort (0), Symbolic
Destination Name=video destination. For voice application
such as encoder scheme is G.729 A, Type of Service (TOS)
Figure 4: Basic Structure of Tree Topology
is best effort (0), voice frames per packet is 1and
compression and decompression delay is 0.02 second. Our
IV. SIMUATION RESULTS
Simulations involves three topologies, the simulation time
is set to be 600 seconds for different routing protocols RIP, Based on our three topologies, we simulated the
RIPng, EIGRP, OSPFv2, OSPFv3, IS-IS and IS-ISv6. performance of each routing protocol on all three
topologies then asses the performance of applications.
We design three scenarios, one working under proper Firstly we ran the simulation on mesh topology for RIP,
condition and one for link failure and the last one was for RIPng, EIGRP, OSPFv2, OSPFv3, IS-IS and IS-ISv6, then
node failure. In link failure scenario, we make the most five repeat the previous step but after applying the two failure
utilized links be dropped between 200 and 380 sec then scenarios. For the normal and failure scenarios we also
gathered our statistics for the routing protocols and evaluate the applications performance.
applications. For the Node Failure Scenario, we chose the Next, we run the simulation for the partial Mesh topology
most utilized link and make the two nodes that connected to but here we don’t use RIP as no. of hops exceed 15 hop so
that line to be dropped between 200 and 270 second then RIP will be unreachable, recording all our statistics as
gathered our statistics for the routing protocols and the mentioned before.
applications. And below you can check our design for Finally, we run the Tree topology like the previous two
Mesh, Partial Mesh and Tree Topology. steps except we ignore RIP as we did in Partial Mesh.
 V. CONCLUSION
Interior Gateway Routing protocols are widely used in
computer networking. In this study we introduced a
comparative analysis of selected routing protocols such as
RIP, EIGRP, OSPF and IS-IS in IPv4 and IPv6. The
comparative analysis has been done with different
protocols for Real Time Applications and Non-Real Time
Applications over different scenarios like scenario with
ordinary condition, link failure scenario and node failure
scenario. Performance has been measured on the basis of
the parameters that aimed to figure out the effect of routing
protocols.
Figure 5: Packet Delay Variation/End to End
Delay In this work, the comparative performance among RIP,
EIGRP, OSPF and IS-IS a protocols in IPv4 and IPv6 for
Real time Applications and Non-Real Time Applications
has been analyzed. By comparing these protocols
performance, we reached to the below recommendation.

Figure 6: Traffic Received/Sent

IPv4 Non-Real Time Applications Real Time Application

Normal Link Node Normal Link Node
Scenario Failure Failure Scenario Failure Failure
Scenario Scenario Scenario Scenario
Mesh ISIS ISIS XXX EIGRP ISIS ISIS,EIGRP
Partial Mesh ISIS ISIS XXX EIGRP ISIS ISIS,OSPF
Tree OSPF,ISIS OSPF EIGRP EIGRP ISIS,OSPF XXX

IPv6 Non-Real Time Applications Real Time Application

Normal Link Node Normal Link Node
Scenario Failure Failure Scenario Failure Failure
Scenario Scenario Scenario Scenario
Mesh ISISv6 ISISv6, ISISv6 ISISv6 ISISv6 OSPFv3
OSPFv3
Partial Mesh ISISv6 OSPFv3 ISISv6 OSPFv3, OSPFv3 ISISv6
ISISv6
Tree OSPFv3 OSPFv3, OSPFv3, ISISv6 OSPFv3 OSPFv3,
ISISv6 ISISv6 ISISv6
Table 1: Recommendation
 REFERENCES
[1] Rajneesh Narula, Pallavi Aggarwal,
“PERFORMANCE EVALUATION OF RIP AND OSPF
IN IPV6 USING OPNET 14.5 SIMULATOR”
Computer Science and Engineering Adesh
Institute of Engineering and Technology
Faridkot, India.
[2] Don Xu and Ljiljana Trajkovic, "Performance
Analysis of RIP, EIGRP and OSPF using OPNET",
vancouver, British Columbia, Canada.
[3] Alex Hinds, Anthony Atojoko, and Shao Ying
Zhu, “Evaluation of OSPF and EIGRP Routing
Protocols for IPv6” International Journal of
Future Computer and Communication, Vol. 2,
No. 4, August 2013
[4] Kuwar Pratap Singh, P. K. Gupta, G. Singh,”
Performance Evaluation of Enhanced Interior
Gateway Routing Protocol in IPv6 Network”
International Journal of Computer Applications
(0975 – 8887) Volume 70– No.5, May 2013
View publication stats
[5] Richard John Whitfield, Shao Ying Zhu, “A
Comparison of OSPFv3 and EIGRPv6 in a Small
IPv6 Enterprise Network” (IJACSA) International
Journal of Advanced Computer Science and
Applications, Vol. 6, No. 1, 2015
[6] ShewayeSirika, SmitaMahajine,
“Performance Evaluation of Dynamic Routing
Protocols for Real time application”
International Journal of Engineering Trends and
Technology (IJETT) – Volume 32 Number 7-
February 2016
[7] Archana Kudtarkar, Reena Sonkusare,
Dayanand Ambawade, “Performance Analysis of
Routing Protocols for Real Time Application”
International Journal of Advanced Research in
Computer and Communication Engineering Vol.
3, Issue 1, January 2014
[8] Kurose, James F. Computer networking: a
top-down approach / James F. Kurose, Keith W.
Ross.—6th Ed.
[9] http://www.computerhope.com