@article{MAKHILLJEAS201914617566,
    title = {Simulation-Based Comparative Study of Routing Protocols for Wired Networks},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {6},
    pages = {1922-1927},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.1922.1927},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.1922.1927},
    author = {Belal,Bilal,Jihad,Jamil al and},
    keywords = {Dynamic Routing Protocols (RP),convergence time,RIPv2,OSPF,EIGRP,IGRP},
    abstract = {Wired networks have gained enormous concern from researchers and application developers because
of the widely used of their network type. Dynamic routing is the process of finding the best path from source
to destination to deliver data packets in the network. Routing paly a significant rule of the overall performance
of the wired network. Each routing protocol has an algorithm and metrics that vary in determining the optimal
path to a network. Therefore, the developers developed several routing protocols to address all aspects of
routing process. The aim of this study is to compare the performance of four routing protocols namely; RIPv2,
OSPF, IGRP and EIGRP experimentally. To generalize the results obtained we tested the performance of the
routing protocols utilizing different application and two different scenarios. The applications used in the
experiments are e-mail, http and database. The simulation was performed using OPNET. The results showed
that in general EIGRP protocol outperform others. Furthermore, specific protocols behave well in some
scenarios.}
    }