IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018
IPV6 BASED RIPNG AND IS-IS PERFORMANCE WITH SEVERAL METRICES USING OPNET KOMAL RANI, RUPINDER KAUR M-TECH STUDENT, ECE DEPARTMENT, PUNJABI UNIVERSITY, PUNJAB, INDIA ASSISTANT PROFESSOR, ECE DEPARTMENT, PUNJABI UNIVERSITY, PUNJAB, INDIA Abstract:Today we can’t assume human life without
1.2 RIP version 2
internet .In modern internet era, communication networks are growing very rapidly. For good communication, network routing protocol play an important role. Routing play an important role to deliver data from source to destination in the network. This Research paper present simulation based performance evaluation of RIPng, IS-IS and (Ripng +IS-IS) .So in this Paper we have designed three network models where Respective Performance Metrics are E-mail upload Response time, E-mail download Response time, Http Page Response Time, Http object Response Time, Remote login Response Time, Video End to End Delay, Voice End to End Delay, MOS value, and Jitter. We find most of them combined Network Performance is better than others. Index terms: OPNET, IPV6, IS-IS, RIPng, Http.
Due to the deficiencies of the original RIP specification, RIP version 2 (RIPv2) was developed in 1993 and last standardized in 1998. It included 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.
1 Routing Information Protocol RIP is oldest version of RIPNG. RIP is also 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 the source to a destination. The maximum number of hops allowed for RIP is 15. This hop limit, however, also limits the size of networks that RIP can support. A hop count of 16 is considered an infinite distance, in other words the route is considered unreachable. RIP implements the split horizon, route poisoning and hold down mechanisms to prevent incorrect routing information from being propagated.It is also possible to use the Routing Information Protocol with Metric-Based Topology (RMTI) algorithm to cope with the count-to-infinity problem. With RMTI, it is possible to detect every possible loop with a very small computation effort. There are three versions of the Routing Information Protocol: RIPv1, RIPv2, and RIPng.
1.1 RIP version 1 The original specification of RIP, defined in RFC 1058, was published in 1988 and 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.
1.3RIPng RIPng (RIP next generation),is an extension of RIPv2 for support of IPv6, the next generation Internet Protocol. The main differences between RIPv2 and RIPng are:
Support of IPv6 networking. While RIPv2 supports RIPv1 updates authentication, RIPng does not. IPv6 routers were, at the time, supposed to use IPsec for authentication. RIPv2 allows attaching arbitrary tags to routes, RIPng does not; RIPv2 encodes the next-hop into each route entries; RIPng requires specific encoding of the next hop for a set of route entries.
2 Intermediate Systems to Intermediate System IS-IS is a link-state interior gateway routing protocol. IS-IS runs the Dijkstra shortest-path first (SPF) algorithm to create a database of the network’s topology and, from that database, to determine the best (that is, shortest) path to a destination. The IS-IS (Intermediate System - Intermediate System) protocol is one of a family member of IP Routing protocols. It is an Interior Gateway Protocol (IGP) for the Internet, used to transfer IP routing information throughout a single Autonomous System (AS) in an IP network. IS-IS is a link-state routing protocol, which means that the routers exchange topology information with their nearest neighbor’s. The topology information is distributed throughout the AS, so that every router within the AS has a complete and clear picture of the topology of the AS. This picture is
Komal Rani; Rupinder Kaur, vol 6 Issue 2, pp 1-6, February 2018
IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018 then used to calculate end-to-end paths within the AS. 3.2 IS-IS Scenario:This scenario representthe IS-IS Paths are calculates using a variant of the Dijkstraalgorithm. In link-state routing protocol, by choosing the best end-to-end path to the eventual destination, we can find the next hop address to which data is forwarded. The main advantage of a link state routing protocol is that the complete knowledge of topology allows routers for calculating the routes which satisfy particular criteria. This can be useful for traffic engineering purposes, where routes can be restricted to meet particular quality of service requirements. When more routers are added to routing domain then this link state routing protocol does not scale well, so this is the main disadvantage .The length of time it takes to calculate end-to-end routes increases as the number of routers increases and then frequency of topology updates. This lack of scalability means that a link state routing protocol is unsuitable for large networks, which is the reason why IGPs only route traffic within a single AS. Each IS-IS router transfers information about its local state (usable interfaces and reachable neighbor’s and the cost of using each interface) to other routers using a Link State PDU (LSP) message. For developing an identical database each router uses the received messages that defines the topology of the AS Using this database, each router calculates its own routing table using a Shortest Path First (SPF) or Dijkstra algorithm. This routing table contains all the destinations the routing protocol knows about which are associated with a next hop IP address and outgoing interface.
3 Simulation Results and Analysis 3.1 RIPng Scenario: The figure 3.1 displays the Scenario of RIPng protocol. This scenario represents the network model which consists of no. of different nodes, links, routers and servers. RIPng protocol based on Bellman Ford algorithm. Hop limit of RIPng is 15. Different no. of nodes is connected to each other and passes data using this protocol. In this scenario there is one application node and profile node where no. of nodes are mentioned.
routing protocol network model. IS-IS based on Dijkstra algorithm. This figure shows different modules used in network model. There is no limit of no. of nodes as in RIPng. Routers transferred the data from source to destination. Routers one by one sent the data to all the nodes and choose the best path for destination, best path means shortest path. IS-IS is link state interior routing protocol.
Figure 3.2 IS-IS Scenario
3.3 Combined Scenario of RIPng and IS-IS: The figure 3.3 represents the combined scenario of three different protocols. This defines the different modules in network model. Different protocols worked on different nodes. According to different algorithms they worked on nodes. Then the performance calculated and compared with previous individual protocols scenarios.
Figure 3.3 Combined scenarios Figure 3.1: RIPng Scenario
Š 2018, IJournals All Rights Reserved
www.ijournals.in
Page 2
IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018 3.4 Comparison of 3 scenarios in terms of Download Response time in Email Download response time is the time it takes to respond to the request for service. Service can be anything from memory fetch to disk or to complex database. For real time applications like email download response time considered importantly. Table 6.1 defined the values of different protocols. IS-IS/RIPng shows best results in figure 3.4. Table 3.1: Table describes comparison in terms of download response time
Applications Email
RIPng
IS-IS
Combined Figure 3.5: E-mail Upload Response Time (sec)
Download Response Time
0.16
0.13
0.12
3.6 Performance Comparison in terms of Remote Login Response Time: Remote Login Response time described as how much time it will take to access another compute (system) remotely online. As per our results hybrid protocols provides as best result. Application Remote Login RIPng IS-IS Combined Response Time Response time 0.19 0.05 0.04 .
Figure 3.4: E-MAIL Download Response Time (sec)
3.5 Comparison of 3 scenarios in terms of Upload response Time in email Total amount of time it takes to upload date on server is known as upload response time. Table 6.2 defined that IS-IS/RIPng combined scenario shows better response, it takes less time to upload the data. Table 3.2: Table describes comparison in terms of upload response time Application Email Upload Response Time(sec)
Figure 3.6: Remote Login ResponseTime RIPng
0.29
IS-IS
0.16
Š 2018, IJournals All Rights Reserved
Combined
0.16
3.7 Performance comparison in terms of Video End to End delay(sec) When the packet transmitted via a convergence duration time network from source to destination then end-to-end delay time has been considered. When it takes too much time to detailed comparative study is given in Tables 4.4 arrive the packet to the receiver.
www.ijournals.in
Page 3
IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018 Table 3.4: Table describes packet delay variation in 3.9 Performance comparison in terms of video conferencing packet End to End Delay variation in voice Application Video Conferencing End to delay(sec)
RIPng
IS-IS
Combined
0.09
0.04
0.04
end
When the packet transmitted via a convergence duration time network from source to destination then end-to-end delay time has been considered. When it takes too much time to detailed comparative study is given in This parameter is defined End to End Delay as a delay in receiving packets at the receiver. On the transmitter side, data packets are sent continuously in the channel. Due to networks congestion, improper queuing, or configuration errors, the packet may not receive, in the order that the transmitter and receiver with the same period were sent. In real-time applications such as videoconferencing and voice packets delay cannot be ignored due to the Packet delay variation, which causes packet loss and also there will be no recovery of voice. Table 3.6: Table describes packet End to End Delay (sec) in voice transmission Application
Figure 3.7: End to end delay in video conferencing
Voice
RIPng
IS-IS
Combined
Packet End to End Delaydelay (sec)
0.15
0.097
0.094
3.8 Performance comparison in terms of jitter in voice trasmission(sec) Jitter is defined as variation in delay times of received packets. At sending sides, packets are sent in a continuous stream in an equally spaced time slots.This rate is much lower than the average rate, resulting from traffic congestion and for improving performance of a voice network this factor should be as small as possible. Table 3.5: Table describes jitter (sec) in voice transmission Application Voice Jitter(sec)
RIPng
IS-IS
Combined
0.0000244
0.00000085
0.00000012
Figure 3.9: Packet End to End Delay delay
3.10 Performance comparison in terms of object response time(sec) in HTTP
Figure 3.8: Jitter in voice
Š 2018, IJournals All Rights Reserved
Response time is the total amount of time it takes to respond to a request for service. That service can be anything from a memory fetch, to a disk IO, to a complex database query, or loading a full web page. Ignoring transmission time for a moment, the response time is the sum of the service time and wait time. The service time is the time it takes to do the work you requested.
www.ijournals.in
Page 4
IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018 Table 3.7: Table describes object response time (sec) in HTTP Application
3.12 Voice MOS ( Mean Opinion Score ) What is Mean Opinion Score?
HTTP
RIPng
ISIS
ORT(sec)
2.3
1.1
Combined 1
In voice and video communication, quality usually dictates whether the experience is a good or bad one. Besides the qualitative description we hear, like 'quite good' or 'very bad', there is a numerical method of expressing voice and video quality. It is called Mean Opinion Score (MOS). MOS gives a numerical indication of the perceived quality of the media received after being transmitted and eventually compressed MOS is expressed in one number, from 1 to 5, 1 being the worst and 5 the best. MOS is quite subjective, as it is based figures that result from what is perceived by people during tests. However, there are software applications that measure MOS on networks, as we see below.
The Mean Opinion Score Values Taken in whole numbers, the numbers are quite easy to grade. Figure 3.10: Object response time (sec)
3.11 Performance comparison in terms of page response time(sec) in HTTP The time takes for each web page to load is known as page response time.It should be low as possible.Table 4.9 showed that combined scenario takes less time than other three scenarios. Table 3.8: Table describes page response time (sec) in HTTP
5 - Perfect. Like face-to-face conversation or radio reception. 4 - Fair. Imperfections can be perceived, but sound still clear. This is (supposedly) the range for cell phones. 3 - Annoying. 2 - Very annoying. Nearly impossible to communicate. 1 - Impossible to communicate
Application HTTP
RIPng
IS-IS
Combined
PRT(sec)
0.36
0.25
0.22
Figure 3.11: Page Response Time
© 2018, IJournals All Rights Reserved
Table 3.9: Table describes page response time (sec) in MOS Application ISHTTP RIPng Combined IS PRT(sec) 3.47 3.51 3.51
Figure 3.12: MOS Value
www.ijournals.in
Page 5
IJournals: International Journal of Software & Hardware Research in Engineering ISSN-2347-4890 Volume 6 Issue 2 February, 2018 As per above figure combined protocol provide best result in mean opinion score
5.1 Conclusion In the present work Performance analysis of selected routing protocols such as RIPng, IS-IS, and the combination of RIPng, IS-IS and calculated. The Performance analysis has been done in the same network with different protocols for real time applications. Performance has been measured on the basis of some parameters that aimed to figure out the effects of routing protocols. In the proposed work, combination of Routing protocols shows better than others . Performance has been measured on the basis of some parameters that aimed to figure out the effects of routing protocols. Respective Performance Metrics are E-mail upload Response time, E-mail download Response time, Http Page Response Time ,Http object Response Time, Remote login Response Time, Video End to End Delay, Voice End to End Delay ,MOS value ,and Jitter .we got that only in video end to end delay RIPng is better and MOS value all three network provides almost equal performance (RIPng +IS-IS) Provide us better Performance in are E-mail upload Response time, Email download Response time, Http Page Response Time ,Http object Response Time, Remote login Response Time, Voice End to End Delay, & Jitter . 5.2 Future scope The proposed model work for the real time applications in IPV6. In future, a research work can be done on Security analysis for RIPng and IS-IS can be done. Further three protocols work on non-real applications on different parameters and servers. 6. References [1] Alex Hinds, Anthony Atojoko, Shao Ying Zhu, “Evaluation of OSPF and EIGRP Routing Protocols forIPv6”, International Journal of Future Computer and Communication, Vol. 2, No. 4, August 2013. [2]ArchanaKudtarka, ReenaSonkusare, ayanandAmbawade, “Performance Analysis of Routing Protocols forReal Time Application”, International Journal of Advanced Research in Computer and Communication Engineering Vol. 3, Issue 1, January 2014 [3] Dr. Rajiv Mahajan, Jagdeep Singh, “Simulation Based Comparative Study of RIP, OSPF and EIGRP”, International Journal of Advanced Research in Computer Science and Software Engineering,Volume 3, Issue 8, August 2013 [4] MohammadNazrulIslamMd. AhsanUllahAshique, “ Simulation Based EIGRP over OSPF Performance Analysis”,Blekinge Institute of Technology School of Computing,May 14, 2010 [5]. S. Farhangi, A. Rostami S. Golmohammadi, “Performance Comparison of Mixed Protocols Based on EIGRP, IS-IS and OSPF for Real-time Applications”, Middle-East Journal of Scientific Research, 2012.
© 2018, IJournals All Rights Reserved
[6] Wu, Bing, "Simulation Based Performance Analyses on RIPv2, EIGRP, and OSPF Using OPNET" .Math and Computer Science Working Papers 2011. [7] SajadFarhangi, SaeedGolmohammadi, “A Comparative Study of IS-IS and IGRP Protocols for Real-Time Application Based on OPNET ” , World Science Publisher, United States, Vol. 1, No. 1, March 2012 [8] Shah.A1 WaqasJ.Rana , “Performance Analysis of RIP and OSPF in Network Using OPNET”, International Journal of Computer Science Issues, Vol. 10, Issue 6, No 2, November 2013 . [9] Shravan K. Narisetty, Santosh K. Balsu , “ Performance Comparison of EIGRP and ISIS/RIP Protocols”,International Journal of Research and Reviews in Ad Hoc Networks (IJRRAN) Vol. xx, No. xx, March 2011 [10] M.Mahendran, V.Vetriselvan1, PravinR.Patil, “Survey on the RIP, OSPF, EIGRP Routing Protocols”, International Journal of Computer Science and Information Technologies, Vol. 5 (2) , 2014. [11] PankajRakheja, Prabhjotkaur, Anjali gupta ,Aditi Sharma “ Performance Analysis of RIP, OSPF, IGRP and EIGRP Routing Protocols in a Network”, International Journal of Computer Applications (0975 – 888) Volume 48– No.18, June 2012 [12] JagmeetKaur, Er.Prabhdeep Singh, “SIMULATION BASED PERFORMANCE ANALYSIS OF IPV6 BASED IS_IS,OSPFV3 AND OSPFV3_IS-IS PROTOCOLS”,international journal of software and hardware research in engineering, vol 2 ,Issue 8,2014 [13] Wu C. “Simulation Based Performance Analyses on RIP, EIGRP and OSPF Using OPNET" [14] Zhengyu X., Sa D. and Aceves G., J J. “A more efficient distance vector routing algorithm”. In Proceedings of the MILCOM, pp.993 – 997. [15] AbsarNurul , Wahab Md. Abdul, UddinSikder Md. Kamor “ Performance Measurement of Open Shortest Path First (OSPF) Protocol in IP Networks, International Journal of Engineering Research , Volume No.6, Issue No.2, pp :110-115. [16]Sanjeev P., Gupta P.K., Arjun G., Prateek M. and Manish C.(2012), “Comparative Analysis of Congestion Control Algorithms Using ns-2”, International Journal of Computer Science Issues, vol. 8, Issue 5, No 1, 89-94. [17] Shah A. and Rana W. J. (2013) “Performance Analysis of RIP and OSPF in Network Using OPNET” IJCSI International Journal of Computer Science Issues, vol. 10, Issue 6, no 2, pp. 256-265. [18]Sharma V., Narula R. and Khullar S. (2012) “Performance Analysis of IEEE 802.3 using IGRP and EIGRP Routing Protocols” International Journal of Computer Applications (0975 – 8887) vol 44, no13. [19]Singh J. and Mahajan R. (2013) “Simulation Based Comparative Study of RIP, OSPF and EIGRP”International Journal of Advanced Research in Computer Science and Software EngineeringSadhana, vol 3, Issue 8, pp. 285-288. [20]Steven M ., Belvvin., Bill C. and Angelos (2006) “worm propagation strategies in an IPv6 Internet” vol 31, no 1, pp.70-77.
www.ijournals.in
Page 6