Optimization of ISP Service Maintenance Router Using Dijkstra and Flyod-Warshall Algorithm

Abstract

In this paper, Dijkstra algorithm and Floyd-Warshall algorithm are proposed to reduce the number of repetitive operations and read the shortest path and the fastest time from the starting point to all other nodes to arrive at the destination. The Dijkstra algorithm is used to sort location data by distance and sort location data based on the travel time using the Floyd-Warshall algorithm. This application is expected to provide benefits as an example to facilitate ISP personnel in obtaining the shortest path information or route to the point of service interruption. This will optimize disruption handling time and vehicle fuel. Operational costs are more efficient. For ISP Consumers, handling disruptions will be more quickly resolved. Test result indicate that the application can show steps to find the route to the ISP service disruption and advise which node is passed for the shortest distance and the fastest time. A numerical example was used to illustrate the efficiency of the proposed technique. The propose technique can be applied to real application transportation system and many other network optimization problem that can be formulated as shortest path problem.