ANALYSIS OF THE CHARACTERISTICS OF ROUTING PROTOCOLS AND ALGORITHMS

Abstract

This study examines the characteristics of routing protocols and
algorithms in data communication networks, focusing on their convergence time,
packet loss, and resource utilization. Using the OPNET Modeler environment, the
research compares protocols such as RIP, OSPF, and EIGRP, with results
indicating that EIGRP outperforms others in efficiency but is limited to Cisco
devices. The findings suggest OSPF as a practical alternative for broader
applications