Volume 3, Issue 7, July – 2018 International Journal of Innovative Science and Research Technology

ISSN No:-2456-2165

Comparative Analysis of RIP and OSPF using

OMNET++
Agaba Francis, Chukwu Emmanuel Aruchi
Research Scholar, Computer Science Department
Ignatius Ajuru University of Education
Rumuolumeni, Port Harcourt, Nigeria.

Abstract:- Different protocols are utilized for sending
the packets in a system topology. For effective
conveyance of the packets from the derivative hub to the
actual target hub a routing table is kept up by the
switches. The measure of system data put away by a
switch relies upon its algorithm. In this paper, the
execution of RIP, and OSPF are assessed based on
network throughput, END-to-END lining postponement
and usage by utilizing OMNET ++ modeller as a re-
enacting apparatus. The system charts are displayed and
thought about for two circumstances of connection
status.
Keywords:- Routing Protocol, RIP, OSPF, OMNET.
Reproductions have been done in OMNET for assessing
these directing conventions against various parameters.
A. Open Shortest Path First (OSPF)
Open Shortest Path First (OSPF) is a versatile
apparatus to exchange directing data inside a solitary
independent framework (Malik et al., 2012). The primary
motivation behind utilizing OSPF convention is completed
wherever this convention partition the house of the system
into two levels of zones wherever the basis introduces grade
that is related to the remainder territories within the second
level (ElSayed et al., 2006). OSPF convention could be a
dynamic convention that provides the system larger
responsibility and similarity (Heydarian, 2012).

I. INTRODUCTION B. Routing Information Protocol (RIP)

Routing protocol is mix of principles and strategies
that enables switches to trade data about changes in the
system with each other inside an Autonomous System.
Moreover, Routing protocol exhibits the best approach to
exchange the messages from point to point over the system.
In this way, the fundamental reason for the steering
convention is to exchange the information parcels over the
system (Celik et al., 2013). The dynamic directing
conventions like RIP, OSPF, EIGRP, ISIS and IGRP
monitors ways utilizing steering calculations for better
execution. Be that as it may, now a days, increment in huge
systems increments directed activity and decreases the
security of the system. The significant foundations for the
debasement of the administration execution in web are
network congestion, link failures, and routing instabilities
(Thorenoor, S.G 2010). It has been discovered that a large
portion of the interruptions happen amid directing changes
(Thorenoor, S.G 2010). A couple of hundred milliseconds of
interruption are sufficient to cause an unsettling influence in
voice and video (Rashed, M. M. G., and Kabir, M. 2010). A
disturbance enduring a couple of moments is sufficiently
long to interrupt web exchanges (Catherine .B et al
2002).Hence, amid Hence, during routing convergence data
packets are dropped, delayed, and gotten out-of-arrange at
the goal coming about in this manner in a genuine
debasement in the system execution (Thorenoor, S.G 2010).
To adequately and productively convey information,
the decision of the steering convention turns out to be
extremely basic factor to characterize the achievement of the
system after some time (Dong Xu 2011). Routing protocols
are the principle factors adding to accelerate information
exchanges inside the system. In this paper, RIP and OSPF
are assessed on various situations for constant applications.
Routing information protocol is the main routing
protocol actualized on TCP/IP, It utilizes a jump tally
system to locate an ideal way for bundle steering. It's have a
most extreme jump check of 16hops. In any case, the way
might be the slowest in the system. RIP is basic and
effective in little systems. In any case, it might be wasteful
in bigger systems. Each RIP switch communicates to
different switches the best way in view of its.
C. Classes of routing protocols
 Interior Gateway Protocols
The two fundamental sorts of algorithm for IP routing
are: Distance Vector Routing and Link State Routing.
 Distance Vector Protocol
Distance vector protocol finds the best way on how far
the goal is, while Link State conventions are equipped for
utilizing more complex strategies thinking about connection
factors, for example, transmission capacity, deferral,
dependability and load. Separation can be jumps or a mix of
measurements computed to speak to a separation esteem.
The IP Distance Vector steering conventions still being used
today are: Routing Information Protocol (RIP v1 and v2)
and Interior Gateway Routing Protocol (IGRP). To work in
little systems, Distance-vector directing conventions are
basic and proficient. Be that as it may, they have poor
meeting and shameful scale, which has prompted the
improvement of more mind boggling yet more adaptable
connection state routing protocols for use in expansive
systems.
 Link State Protocol
A Link-state directing is an idea utilized as a part of
steering of parcel exchanged systems in PC

IJISRT18JL285 www.ijisrt.com 761

Volume 3, Issue 7, July – 2018
correspondences. Connection state directing works by
having the switches educate each switch on the system
regarding its nearest neighbours. The whole directing table
isn't disseminated from any switch, just the piece of the table
containing its neighbours. A portion of the connection state
directing conventions are the OSPF, IS-IS and EIGRP. This
sort of directing convention requires every switch to keep up
no less than a fractional guide of the system. At the point
when a system connects changes express, a warning, called
a link state advertisement (LSA) is overflowed all through
the system. Every one of the switches takes note of the
change, and re-register their courses as needs be. Connection
State routing conventions give more prominent adaptability
and advancement than the Distance Vector steering
conventions. They lessen general communicate activity and
settle on better choices about steering by taking attributes,
for example, data transfer capacity, deferral, unwavering
quality, and load into thought, rather than constructing their
choices exclusively with respect to separation or jump tally
(http://www.informit.com/articles/article.aspx?).
International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
affiliation measurements within the shortest path routing
(Ramakrishnan and Rodrigues, 2001).
III. SIMULATION
OMNeT++ (Objective Modular Network Testbed in
C++) is a particular, segment based C++ re-enactment
library and system, principally to build organizes test
systems. OMNeT++ can be utilized for non-business re-
enactments like at scholarly organizations and for
instructing. OMNEST is an expanded form of OMNeT++
for business utilizes cases. OMNeT++ itself is a recreation
structure (not a test system) without models for network
protocols like IP or HTTP.

 Exterior Gateway Protocols

The gateway protocols actualize way vector
convention, they are utilized as a part of web for the trading
of directing data between self-governing frameworks, For
instance Border Gateway convention (BGP), Path vector
routing protocol.

II. LITERATURE REVIEW Fig 1:- Network topology

Different investigations have talked about the capacity
IV. RESULTS AND ANALYSIS OF SIMULATION
and the similarity of the system conventions and calculations
by utilizing numerous ideas and techniques. Numerous
scientists exhibit various techniques to enhance the guiding There are two Network models, which are configured,
protocols and in another hand the examinations investigate and run, these network models are RIP protocol and OSPF
this methodology; here we have a tendency to quickly talk protocol. The duration for simulation processes hold on for
regarding a number of them. Guiding procedure over a 700 sec. The link utilization varies between 0 and 100%.
system utilizing selection standards from physical
hypotheses and that they used the all inclusive metric to see OSPF RIP
the measurements of various routing protocol, End To End Delay (milisec) 5.81E-02 4.36E-02
parenthetically, OSPF protocol, EIGRP protocol and RIP
protocol (Sukhov and Chemodanov, 2013).

Generally, past investigations of various steering

endToEndDelay (milisec)
conventions, for example, EIGRP and OSPF have been done
in view of recreation, in which the creators have focused on 6.00E-02
near execution and in point by point re-enactment ponder
completed in the IP arrange (Farhangi, S., and 5.00E-02
Golmohammadi, S. 2012). 4.00E-02
3.00E-02 endToEndDelay
A method was utilised to limit the deferral for
information bundles over a system, this procedure is cleanup 2.00E-02 (milisec)
procedure in fact reserves for hubs within a functioning 1.00E-02
course (Hacene and Lehireche, 2011). They utilised the
GLOMOSIM take a look at system to actualize this 0.00E+00
technique that incontestable a good execution, therefore this OSPF RIP
procedure achievements in 4 | P a g e taking care of the set
back issue. Another examination that search for a shortest
path routing problem. The projected algorithm diminished
Fig 2:- Simulation result of End-to-end delay of the
the postponement of PACKETS exchange over the system.
networks
They exhibit a mix algorithmic program that found ideal

IJISRT18JL285 www.ijisrt.com 762

Volume 3, Issue 7, July – 2018
A. End-to-end delay for video streaming:
Figure 2 shows the End-to-End delay of the systems.
End-to-End delay are often characterised because of
the time that is taken to exchange a data packet over the
network from the supply to the destination. At the
purpose once a packet arrives past the purpose of no return
at the recipient as a result; the packets are often adequately
lost that is the basic significance of end-to-end delay. Owing
to deferral, lost packets negative have an effect on the
quality for each video and voice movement. Fig. 1, shows
that the end-to-end delay of OSPF protocol
has higher performance scrutiny with RIP protocol.
OSPF RIP
frame/sec 13.985 0.526666667
frame/sec
International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
C. Receiver Channel Utilization
Channel utilization is quite a term known with the
use of the channel neglecting the outturn. It tallies with the
knowledge bits moreover like the overhead that produces
utilization of the channel. The transmission
overhead contains introduction successions, define headers
and acknowledge packets. The definitions expect a quiet
channel.
One thing else, the outturn wouldn't be simply relating
to the character (proficiency) of the protocol, nonetheless in
addition to re-transmissions resultant from nature of the
channel. During a short-sighted approach, channel
proficiency can be equivalent to channel use accepting that
recognize packets are zero-length and that the interchanges
supplier won't perceive any transfer speed in respect to re-
transmissions or headers. Consequently, bound writings
stamp a distinction between channel use and protocol
proficiency. The consequence of the recreation proposes that
OSPF uses a lot of noteworthy data parcel over the system
than RIP.

20 V. CONCLUSION

In this examination, we show a relative report between

frame/sec two routing protocols RIP and OSPF. This examination is
0 frame/sec connected by utilizing OMNET test system. OSPF protocols
OSPF indicate preferred merging time over RIP protocol.
RIP
Likewise, the re-enactment comes about recommend that the
utilizing of OSPF protocol is superior to utilizing RIP
protocol, as indicated by the conclusion to-end defer time.
Re-enactment demonstrates that the throughput in OSPF
Fig 3:- Simulation result of frame/sec protocol is greatly improved than in RIP protocol. The
activity in OSPF case is higher than in RIP case. This
B. Frame rate/sec examination demonstrates that the system will be quicker
Frame rate is the frequency (rate) at which back to and more versatility by utilizing OSPF protocol than
back pictures called outlines show up on a show. Edge rate utilizing RIP protocol, so the execution of the system
may likewise be called outline recurrence and is increment by utilizing OSPF protocol.
communicated in hertz. The rate of casing that is been
exchange from the sender to recipient is higher in OSPF REFERENCE
than RIP. [1]. Catherine B., Gianluca I.,& Christophe D., 2002.
“Impact of link failures on VoIP performance,” In
OSPF RIP Proceedings of NOSSDAV Workshop, ACM press,
rx channel utilization (%) 0.009620693 3.52E-04 Florida, USA, pages 63-71.
[2]. Celik, F., A. Zengin and B. Cobanglu, 2013. Discrete
event simulation-based performance evaluation of
internet routing protocols. Turk. J. Electr. Eng. Co., 21:
rx channel utilization 1720-1736.
[3]. Dong Xu, 2011 “Analysis of OSPF, EIGRP and RIP
(%) protocols for real time applications.”
http://www.sfu.ca/~donx/” SFU proceedings Spring.
[4]. El-Sayed, H., M. Ahmed, M. Jaseemuddin and D.C.
0.01
Petriu, 2006. Framework for performance engineering
rx channel of OSPF software. IEE Proc-Softw., 153: 219-229.
0.005
utilization (%) [5]. Farhangi, S., & Golmohammadi, S. 2012. A
comparative study between combination of PQ and
0 MWRR Queuing techniques in IP network based on
OSPF RIP OPNET. Advances in Computer Science and its
Applications, 1(1), 63-66.
Fig 4:- Simulation result of receiver channel utilization

IJISRT18JL285 www.ijisrt.com 763

 Volume 3, Issue 7, July – 2018 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
[6]. Hacene, S.B. and A. Lehireche, 2011. Coherent route
cache in dynamic source routing for ad hoc networks.
Comput. Sci. J. Moldova, 19: 304-319.
[7]. Heydarian, M., 2012. A high performance optimal
dynamic routing algorithm with unicast multichannel
QoS guarantee in communication systems. J.
Supercomput., 62: 315-344.
[8]. Malik, S.U., S.K. Srinivasan and S.U. Khan, 2012.
Convergence time analysis of open shortest path first
routing protocol in internet scale networks. Electron.
Lett., 48: 1188-1190.
[9]. Rashed, M. M. G., & Kabir, M. 2010. A comparative
study of different queuing techniques in VOIP, video
conferencing and file transfer.
[10]. Renata Teixeira, Jennifer Rexford, 2006 “Managing
Routing Disruptions in Internet Service Provider
Networks,” IEEE Communications Magazine.
[11]. Sukhov, A.M. and D .Y. Chemodanov, 2013. A metric
for dynamic routing based on variational principles. J.
High Speed Netw., 19: 155-163.
[12]. Thorenoor, S.G. 2010 ”Dynamic Routing Protocol
Implementation Decision between EIGRP, OSPF and
RIP Based on Technical Background Using OPNET
Modeler” (Wipro, Bangalore, India) Source:
Proceedings of the 2010 Second International
Conference on Computer and Network Technology
(ICCNT 2010), p191-5,
http://www.informit.com/articles/article.aspx?p=26129
http://en.wikibooks.org/wiki/CCNA_Certification/Routi
ng_Protocols.

IJISRT18JL285 www.ijisrt.com 764