Optimization of Hello Interval in OSPF Routing Protocol Performance on Mesh Network Topology

Open Shortest Path First (OSPF) is a routing protocol employing the link-state algorithm. OSPF can send routing information inside a router connected to an autonomous system (AS). One of the attributes of OSPF needs to be optimized to maximize the performance of the OSPF routing protocol in the future due to the increasingly large and wide area of computer networks. The problem that will arise from the greater and wider effect of computer networks is the longer time for updating the routing table in the OSPF routing protocol. One of the attributes that can be optimized is the hello interval. This research aims to find out the effect of changing hello intervals in the performance of the OSPF routing protocol. The data collection of this research was conducted by simulating the network topology that has been designed on a network simulation software, conducting the test scenario that has been designed, observing and analyzing the data that has been presented. The results of this research indicate that the change of the hello interval value can affect the convergence time and selection of designated routing (DR) and backup designated routing (BDR) in the OSPF routing protocol. The best hello-interval optimization for the OSPF routing protocol is the hello interval is 1 second while the convergence time is smaller than the others is 11.7 seconds.