Optimized open shortest path first algorithm based on moth flame optimization

Abstract

Objectives: This paper optimizes the performance of Open Shortest Path First (OSPF) algorithm by using moth flame optimization, even in the presence of attacker node. Methods/Statistical Analysis: The OSPF algorithm is the most used and efficient algorithm to select the shortest path between the source and destination. This paper modifies the OSPF by using the moth-flame optimization algorithm. The moth flame optimization depicts the routing behavior of the moth. Each node position is considered as the moth position and routing behavior of moth is used to select the optimized path. Findings: The performance of the optimized OSPF algorithm is analyzed in terms of delay and energy consumption and compared with the existing OSPF as well as modified open shortest path first algorithm. The simulation results show the reduction in delay and energy consumptionin the optimized OSPF as compared to traditional and modified OSPF on different scenarios even in the presence of attacker node. Application/Improvements: The optimized OSPF can be used forrouting even in huge networks with heterogeneous nodes. The Optimized OSPF can also be used for secure routing, data will be travelled from source to destination even if shortest path contains attacker node.