Performance Evaluation of OSPF Routing Protocol Using Shortest Path Model

Abstract

The study evaluated the performance of the OSPF routing protocol using shortest path models under two distinct scenarios simulated in MATLAB R2021a; single link failure/recovery and no failure/recovery condition. In the failure/recovery scenario, deliberate disruption of a critical link triggered recalculation of shortest paths through Dijkstra’s algorithm, resulting in increased convergence time, higher routing overhead, reduced packet delivery ratio, and elevated latency. Recovery of the failed link demonstrated OSPF’s resilience, as performance metrics stabilized and returned close to baseline values. In contrast, the no failure/recovery condition established benchmark performance, with minimal routing overhead, near-perfect packet delivery ratio, consistently low latency, and rapid convergence. Comparative analysis highlighted that while OSPF experiences temporary degradation during disruptions, its recovery mechanisms ensure restoration of reliable communication and efficient routing, confirming the protocol’s robustness in dynamic network environments.