Computation Performance Optimization Technique of Shortest Path Routing Algorithm in Networks Using Out-degree

Abstract

Objective: This paper presents a novel technique in Dijkstra's routing algorithm by considering the concept of out degree which will decrease the computational cost and increase the speed of execution.Methods: In this proposed method the time taken by this algorithm that runs as a combination of the input distance is calculated. Conversely, a computation time complexity measures how efficient it is. accuracy of this method. The Shortest Path Problem is the problem of finding a path in a digraph between two vertices or nodes to minimize the sum of the weights of the edges of its constituent. In the existing approach it specifies a number of nodes as the plot unfolds and calculates the quickest route between it and most other nodes. which will complex the speed of execution.Findings: The proposed out degree approach will resolve that drawback by computing two minimum distance from initial table and this operates from the source node and determines the shortest path over the network as a whole. It also guarantees to find a globally optimal solution path with accurate results.Novelty: The algorithm’s description and comparison are presented in graphical ways to determine the algorithm’s features. The analysis shows that the best route from source to destination will be established which provides the shortest distance. The optimal pathways discovered as a result of the analysis which reduce the distance traveled by the company in shipping products and reduce the time and cost of delivery.