Performance Evaluation of Dynamic Routing Protocols

  • Waleed Iftikhar Department of Computing, Asia pacific University of Technology and Innovation, Malaysia
Keywords: Network Designing, Network Performance, Dynamic Routing Protocols, RIP-OSPFEIGRP- IGRP


Routing protocols are an essential component while performing routing. Majority of the researches put stress on the analysis of the security of IPv6 routing protocols as a future research work. In case of DB query response time, EIGRPv6 did not perform well as compare to other two routing protocols. While for voice and video, jitter, packet end-to-end delay, EIGRPv6 performed best among other routing protocols. Their evaluation involved four pairs of scenarios and each pair dedicated to respective routing protocols to be analyzed. Finally, their results also predicted that communication between ISIS and OSPF routing protocols is quite noticeable. The major purpose of their research was to figure out the best possible combined solution of routing protocols in a complex scenario to provide a seamless flow of communication. While, in the combined network, RIP-OSPF combination had a low CPU utilization in comparison to EIGRP-OSPF combination. This paper will conduct a performance evaluation and analysis of routing protocols, RIP, OSPF, EIGRP and IGRP using different performance metrics. In a  situation where there are frequent network topological changes, RIP and IGRP are the least suited routing protocols. While EIGRP and OSPF are the best suited routing protocols in a changing network environment. OSPF can be a better choice than EIGRP considering transmission cost and router overhead, while EIGRP performed best in terms of convergence, utilization, delay and throughput. Hence it becomes really difficult to select among OPSF and EIGRP. Future research can be based on selecting a routing protocol among OSPF

How to Cite
Waleed Iftikhar. (2020). Performance Evaluation of Dynamic Routing Protocols. Lahore Garrison University Research Journal of Computer Science and Information Technology, 4(1), 21-32.